./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74f29702f111ed73ba2cd9dfef16b5785bcb6a565ff8c65e98f4116fd8b0956 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:19:03,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:19:03,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:19:03,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:19:03,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:19:03,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:19:03,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:19:03,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:19:03,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:19:03,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:19:03,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:19:03,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:19:03,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:19:03,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:19:03,304 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:19:03,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:19:03,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:19:03,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:19:03,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:19:03,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:19:03,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:19:03,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:19:03,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:19:03,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:19:03,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:19:03,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:19:03,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:19:03,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:19:03,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:19:03,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:19:03,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:19:03,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:19:03,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:19:03,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:19:03,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:19:03,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:19:03,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:19:03,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:19:03,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:19:03,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:19:03,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:19:03,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:19:03,309 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a74f29702f111ed73ba2cd9dfef16b5785bcb6a565ff8c65e98f4116fd8b0956 [2024-10-24 00:19:03,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:19:03,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:19:03,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:19:03,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:19:03,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:19:03,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c [2024-10-24 00:19:04,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:19:04,924 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:19:04,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c [2024-10-24 00:19:04,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6493b495/787895796e674ad48b714bc2295549d8/FLAGbea6b9d46 [2024-10-24 00:19:04,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6493b495/787895796e674ad48b714bc2295549d8 [2024-10-24 00:19:04,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:19:04,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:19:04,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:19:04,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:19:04,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:19:04,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:19:04" (1/1) ... [2024-10-24 00:19:04,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5c11c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:04, skipping insertion in model container [2024-10-24 00:19:04,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:19:04" (1/1) ... [2024-10-24 00:19:05,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:19:05,136 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c[538,551] [2024-10-24 00:19:05,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:19:05,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:19:05,166 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c[538,551] [2024-10-24 00:19:05,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:19:05,186 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:19:05,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05 WrapperNode [2024-10-24 00:19:05,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:19:05,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:19:05,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:19:05,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:19:05,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,221 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-10-24 00:19:05,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:19:05,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:19:05,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:19:05,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:19:05,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 00:19:05,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:19:05,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:19:05,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:19:05,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:19:05,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (1/1) ... [2024-10-24 00:19:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:19:05,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:19:05,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:19:05,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:19:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:19:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:19:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:19:05,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:19:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 00:19:05,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 00:19:05,371 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:19:05,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:19:05,541 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-24 00:19:05,541 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:19:05,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:19:05,571 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 00:19:05,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:05 BoogieIcfgContainer [2024-10-24 00:19:05,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:19:05,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:19:05,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:19:05,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:19:05,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:19:04" (1/3) ... [2024-10-24 00:19:05,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15976867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:19:05, skipping insertion in model container [2024-10-24 00:19:05,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:05" (2/3) ... [2024-10-24 00:19:05,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15976867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:19:05, skipping insertion in model container [2024-10-24 00:19:05,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:05" (3/3) ... [2024-10-24 00:19:05,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound2.c [2024-10-24 00:19:05,598 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:19:05,598 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:19:05,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:19:05,648 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26c1e6c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:19:05,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:19:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 00:19:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 00:19:05,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:05,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:05,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 65649153, now seen corresponding path program 1 times [2024-10-24 00:19:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825400658] [2024-10-24 00:19:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:19:05,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:05,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825400658] [2024-10-24 00:19:05,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825400658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:05,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:05,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 00:19:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701069988] [2024-10-24 00:19:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:19:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:19:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:19:05,827 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:19:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:05,859 INFO L93 Difference]: Finished difference Result 48 states and 82 transitions. [2024-10-24 00:19:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:19:05,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 00:19:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:05,873 INFO L225 Difference]: With dead ends: 48 [2024-10-24 00:19:05,873 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 00:19:05,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:19:05,886 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:05,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 00:19:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 00:19:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:19:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2024-10-24 00:19:05,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2024-10-24 00:19:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:05,922 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2024-10-24 00:19:05,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:19:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2024-10-24 00:19:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 00:19:05,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:05,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:05,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:19:05,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:05,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1205755883, now seen corresponding path program 1 times [2024-10-24 00:19:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715834828] [2024-10-24 00:19:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:19:06,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715834828] [2024-10-24 00:19:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715834828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:19:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536141052] [2024-10-24 00:19:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:19:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:06,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:19:06,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:19:06,089 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:19:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:06,173 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2024-10-24 00:19:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:19:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 00:19:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:06,174 INFO L225 Difference]: With dead ends: 37 [2024-10-24 00:19:06,174 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 00:19:06,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:06,175 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:06,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 00:19:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2024-10-24 00:19:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:19:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-24 00:19:06,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2024-10-24 00:19:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:06,185 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-24 00:19:06,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:19:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-24 00:19:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 00:19:06,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:06,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:06,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 00:19:06,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:06,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2004332404, now seen corresponding path program 1 times [2024-10-24 00:19:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252493320] [2024-10-24 00:19:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:19:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252493320] [2024-10-24 00:19:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252493320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 00:19:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807791680] [2024-10-24 00:19:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:19:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:19:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:19:06,258 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:19:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:06,276 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-10-24 00:19:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:19:06,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 00:19:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:06,278 INFO L225 Difference]: With dead ends: 43 [2024-10-24 00:19:06,278 INFO L226 Difference]: Without dead ends: 29 [2024-10-24 00:19:06,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:19:06,279 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:06,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-24 00:19:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-24 00:19:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:19:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-24 00:19:06,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2024-10-24 00:19:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-24 00:19:06,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:19:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-24 00:19:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 00:19:06,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:06,288 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:06,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 00:19:06,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:06,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1962237034, now seen corresponding path program 1 times [2024-10-24 00:19:06,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:06,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790570020] [2024-10-24 00:19:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:19:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:19:06,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:06,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790570020] [2024-10-24 00:19:06,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790570020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:06,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:19:06,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165670657] [2024-10-24 00:19:06,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:06,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:19:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:06,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:19:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:19:06,396 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 00:19:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:06,439 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-10-24 00:19:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:19:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 00:19:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:06,441 INFO L225 Difference]: With dead ends: 43 [2024-10-24 00:19:06,441 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 00:19:06,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:06,442 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:06,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 00:19:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-10-24 00:19:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:19:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-24 00:19:06,456 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2024-10-24 00:19:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:06,456 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-24 00:19:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 00:19:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-24 00:19:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 00:19:06,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:06,457 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 00:19:06,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:06,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 608183541, now seen corresponding path program 1 times [2024-10-24 00:19:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153128665] [2024-10-24 00:19:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:19:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424610] [2024-10-24 00:19:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:06,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:19:06,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:19:06,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:19:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:06,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 00:19:06,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:19:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:19:06,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:19:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153128665] [2024-10-24 00:19:06,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:19:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424610] [2024-10-24 00:19:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:06,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:19:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461981314] [2024-10-24 00:19:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:06,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:19:06,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:06,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:19:06,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:19:06,655 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:19:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:06,724 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2024-10-24 00:19:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:19:06,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-24 00:19:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:06,725 INFO L225 Difference]: With dead ends: 62 [2024-10-24 00:19:06,725 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 00:19:06,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:06,726 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:06,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:19:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 00:19:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 00:19:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 00:19:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-24 00:19:06,734 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 19 [2024-10-24 00:19:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:06,734 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-24 00:19:06,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:19:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-24 00:19:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 00:19:06,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:06,735 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:06,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:19:06,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:06,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:06,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash 560729168, now seen corresponding path program 1 times [2024-10-24 00:19:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:06,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147093407] [2024-10-24 00:19:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:19:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 00:19:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 00:19:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:19:07,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:07,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147093407] [2024-10-24 00:19:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147093407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:19:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149707582] [2024-10-24 00:19:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:07,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:19:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:19:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:07,040 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:19:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:07,073 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-24 00:19:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 00:19:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-24 00:19:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:07,075 INFO L225 Difference]: With dead ends: 66 [2024-10-24 00:19:07,075 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 00:19:07,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:07,076 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:07,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 00:19:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-24 00:19:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 00:19:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2024-10-24 00:19:07,083 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 27 [2024-10-24 00:19:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:07,084 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-10-24 00:19:07,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:19:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-10-24 00:19:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 00:19:07,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:07,085 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:07,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:19:07,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:07,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 562457046, now seen corresponding path program 1 times [2024-10-24 00:19:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:07,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432800288] [2024-10-24 00:19:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:19:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280728747] [2024-10-24 00:19:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:19:07,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:19:07,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:19:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 00:19:07,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:19:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:19:07,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:19:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:07,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432800288] [2024-10-24 00:19:07,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:19:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280728747] [2024-10-24 00:19:07,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280728747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:07,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:07,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:19:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020563895] [2024-10-24 00:19:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:07,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:19:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:19:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:19:07,235 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:19:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:07,296 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-10-24 00:19:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:19:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-24 00:19:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:07,297 INFO L225 Difference]: With dead ends: 72 [2024-10-24 00:19:07,298 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 00:19:07,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:07,298 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:07,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 00:19:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-24 00:19:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:19:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2024-10-24 00:19:07,314 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 27 [2024-10-24 00:19:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2024-10-24 00:19:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:19:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2024-10-24 00:19:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 00:19:07,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:07,319 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:07,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:19:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 00:19:07,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash 976926058, now seen corresponding path program 1 times [2024-10-24 00:19:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748394671] [2024-10-24 00:19:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:19:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 00:19:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 00:19:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:19:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:19:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748394671] [2024-10-24 00:19:07,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748394671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:19:07,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427219899] [2024-10-24 00:19:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:19:07,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:19:07,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:19:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:07,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 00:19:07,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:19:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 00:19:07,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:19:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:19:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427219899] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:19:07,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:19:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2024-10-24 00:19:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031174071] [2024-10-24 00:19:07,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:19:07,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:19:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:19:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:19:07,770 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 00:19:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:07,808 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2024-10-24 00:19:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 00:19:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 34 [2024-10-24 00:19:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:07,810 INFO L225 Difference]: With dead ends: 96 [2024-10-24 00:19:07,810 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 00:19:07,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:19:07,811 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:07,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 00:19:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 00:19:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:19:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2024-10-24 00:19:07,827 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 34 [2024-10-24 00:19:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:07,827 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2024-10-24 00:19:07,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 00:19:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2024-10-24 00:19:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 00:19:07,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:07,829 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:07,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:19:08,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:08,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1560293058, now seen corresponding path program 1 times [2024-10-24 00:19:08,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:08,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862854764] [2024-10-24 00:19:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:08,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:19:08,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000827117] [2024-10-24 00:19:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:08,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:19:08,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:19:08,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:19:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 00:19:08,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:19:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 00:19:08,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:19:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 00:19:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862854764] [2024-10-24 00:19:08,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:19:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000827117] [2024-10-24 00:19:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000827117] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 00:19:08,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:19:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-24 00:19:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926591181] [2024-10-24 00:19:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:19:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:19:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:19:08,239 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:19:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:08,318 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-10-24 00:19:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:19:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-24 00:19:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:08,320 INFO L225 Difference]: With dead ends: 84 [2024-10-24 00:19:08,320 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 00:19:08,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:19:08,320 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:08,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:19:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 00:19:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-24 00:19:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 55 states have internal predecessors, (63), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 00:19:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2024-10-24 00:19:08,330 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 37 [2024-10-24 00:19:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:08,331 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2024-10-24 00:19:08,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:19:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2024-10-24 00:19:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 00:19:08,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:08,332 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:08,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:19:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:08,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1166816529, now seen corresponding path program 1 times [2024-10-24 00:19:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595389809] [2024-10-24 00:19:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:08,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:19:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 00:19:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 00:19:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 00:19:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:19:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:19:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:19:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 00:19:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:19:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595389809] [2024-10-24 00:19:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595389809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:19:08,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:19:08,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:19:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848294864] [2024-10-24 00:19:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:19:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:19:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:19:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:19:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:19:08,639 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 00:19:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:19:08,678 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2024-10-24 00:19:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:19:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2024-10-24 00:19:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:19:08,679 INFO L225 Difference]: With dead ends: 87 [2024-10-24 00:19:08,679 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 00:19:08,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:19:08,680 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:19:08,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:19:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 00:19:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 00:19:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:19:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-10-24 00:19:08,689 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2024-10-24 00:19:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:19:08,689 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-10-24 00:19:08,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 00:19:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-10-24 00:19:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 00:19:08,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:19:08,690 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:08,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 00:19:08,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:19:08,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:19:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash 367273510, now seen corresponding path program 1 times [2024-10-24 00:19:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:19:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327452131] [2024-10-24 00:19:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:19:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:19:08,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157449197] [2024-10-24 00:19:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:19:08,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:19:08,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:19:08,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:19:08,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:19:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 00:19:08,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 00:19:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 00:19:08,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 00:19:08,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 00:19:08,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 00:19:08,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:19:08,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 00:19:08,996 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:19:09,022 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 00:19:09,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:19:09 BoogieIcfgContainer [2024-10-24 00:19:09,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 00:19:09,024 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 00:19:09,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 00:19:09,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 00:19:09,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:05" (3/4) ... [2024-10-24 00:19:09,025 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 00:19:09,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 00:19:09,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 00:19:09,058 INFO L158 Benchmark]: Toolchain (without parser) took 4107.80ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 58.3MB in the beginning and 113.0MB in the end (delta: -54.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,059 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 00:19:09,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.66ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 58.1MB in the beginning and 124.2MB in the end (delta: -66.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 161.5MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,059 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 161.5MB. Free memory was 122.1MB in the beginning and 121.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,059 INFO L158 Benchmark]: RCFGBuilder took 317.07ms. Allocated memory is still 161.5MB. Free memory was 121.0MB in the beginning and 107.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,060 INFO L158 Benchmark]: TraceAbstraction took 3449.00ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 106.4MB in the beginning and 116.1MB in the end (delta: -9.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,060 INFO L158 Benchmark]: Witness Printer took 33.76ms. Allocated memory is still 195.0MB. Free memory was 116.1MB in the beginning and 113.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 00:19:09,061 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.66ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 58.1MB in the beginning and 124.2MB in the end (delta: -66.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 161.5MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 161.5MB. Free memory was 122.1MB in the beginning and 121.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.07ms. Allocated memory is still 161.5MB. Free memory was 121.0MB in the beginning and 107.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3449.00ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 106.4MB in the beginning and 116.1MB in the end (delta: -9.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Witness Printer took 33.76ms. Allocated memory is still 195.0MB. Free memory was 116.1MB in the beginning and 113.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L35] EXPR counter++ VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L35] EXPR counter++ VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L39] COND TRUE !(r >= d) VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L45] EXPR counter++ VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L45] COND FALSE !(counter++<2) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 880 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 593 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 289 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 287 mSDtfsCounter, 289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 4 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 319/330 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 00:19:09,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE