./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:28:15,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:28:15,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:28:15,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:28:15,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:28:15,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:28:15,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:28:15,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:28:15,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:28:15,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:28:15,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:28:15,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:28:15,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:28:15,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:28:15,199 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:28:15,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:28:15,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:28:15,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:28:15,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:28:15,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:28:15,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:28:15,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:28:15,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:28:15,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:28:15,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:28:15,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:28:15,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:28:15,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:28:15,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:28:15,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:28:15,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:28:15,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:28:15,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:28:15,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:28:15,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:28:15,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:28:15,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:28:15,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:28:15,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:28:15,209 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2024-10-12 22:28:15,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:28:15,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:28:15,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:28:15,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:28:15,468 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:28:15,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-12 22:28:16,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:28:17,067 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:28:17,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-12 22:28:17,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912eaabbf/aef349efbbd04c90a07260ac5037aab2/FLAGc97a7466e [2024-10-12 22:28:17,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912eaabbf/aef349efbbd04c90a07260ac5037aab2 [2024-10-12 22:28:17,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:28:17,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:28:17,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:28:17,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:28:17,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:28:17,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a96a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17, skipping insertion in model container [2024-10-12 22:28:17,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:28:17,287 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/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-12 22:28:17,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:28:17,356 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:28:17,367 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/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-12 22:28:17,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:28:17,422 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:28:17,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17 WrapperNode [2024-10-12 22:28:17,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:28:17,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:28:17,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:28:17,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:28:17,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,516 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 370 [2024-10-12 22:28:17,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:28:17,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:28:17,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:28:17,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:28:17,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,586 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 22:28:17,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:28:17,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:28:17,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:28:17,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:28:17,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (1/1) ... [2024-10-12 22:28:17,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:28:17,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:28:17,682 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-12 22:28:17,684 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-12 22:28:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:28:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:28:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 22:28:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:28:17,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:28:17,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:28:17,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:28:18,437 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2024-10-12 22:28:18,438 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:28:18,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:28:18,477 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:28:18,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:28:18 BoogieIcfgContainer [2024-10-12 22:28:18,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:28:18,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:28:18,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:28:18,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:28:18,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:28:17" (1/3) ... [2024-10-12 22:28:18,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193456c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:28:18, skipping insertion in model container [2024-10-12 22:28:18,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:17" (2/3) ... [2024-10-12 22:28:18,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193456c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:28:18, skipping insertion in model container [2024-10-12 22:28:18,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:28:18" (3/3) ... [2024-10-12 22:28:18,491 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2024-10-12 22:28:18,508 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:28:18,508 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:28:18,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:28:18,620 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;@77d097fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:28:18,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:28:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 22:28:18,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:18,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:18,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:18,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1285680966, now seen corresponding path program 1 times [2024-10-12 22:28:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073376142] [2024-10-12 22:28:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:19,445 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-12 22:28:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073376142] [2024-10-12 22:28:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073376142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726959487] [2024-10-12 22:28:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:19,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:19,480 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:19,548 INFO L93 Difference]: Finished difference Result 156 states and 231 transitions. [2024-10-12 22:28:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:28:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-12 22:28:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:19,560 INFO L225 Difference]: With dead ends: 156 [2024-10-12 22:28:19,560 INFO L226 Difference]: Without dead ends: 86 [2024-10-12 22:28:19,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:19,568 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 29 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:19,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 329 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-12 22:28:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-12 22:28:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 85 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-10-12 22:28:19,608 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 38 [2024-10-12 22:28:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:19,608 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-10-12 22:28:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-10-12 22:28:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 22:28:19,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:19,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:19,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:28:19,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:19,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1254276020, now seen corresponding path program 1 times [2024-10-12 22:28:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968926069] [2024-10-12 22:28:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:19,953 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-12 22:28:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968926069] [2024-10-12 22:28:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968926069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035397870] [2024-10-12 22:28:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:19,960 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:19,996 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2024-10-12 22:28:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:28:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-12 22:28:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:19,998 INFO L225 Difference]: With dead ends: 90 [2024-10-12 22:28:19,998 INFO L226 Difference]: Without dead ends: 88 [2024-10-12 22:28:19,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12 22:28:19,999 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:20,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-12 22:28:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-12 22:28:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 87 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-10-12 22:28:20,015 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 39 [2024-10-12 22:28:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:20,016 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-10-12 22:28:20,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-10-12 22:28:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 22:28:20,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:20,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:20,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:28:20,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:20,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash -226155582, now seen corresponding path program 1 times [2024-10-12 22:28:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:20,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413766074] [2024-10-12 22:28:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:20,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:20,240 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-12 22:28:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413766074] [2024-10-12 22:28:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413766074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806044176] [2024-10-12 22:28:20,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:20,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:20,245 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:20,286 INFO L93 Difference]: Finished difference Result 161 states and 232 transitions. [2024-10-12 22:28:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:28:20,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-12 22:28:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:20,288 INFO L225 Difference]: With dead ends: 161 [2024-10-12 22:28:20,288 INFO L226 Difference]: Without dead ends: 90 [2024-10-12 22:28:20,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12 22:28:20,289 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:20,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-12 22:28:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-12 22:28:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.449438202247191) internal successors, (129), 89 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-10-12 22:28:20,296 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 40 [2024-10-12 22:28:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:20,297 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-10-12 22:28:20,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-10-12 22:28:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 22:28:20,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:20,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:20,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:28:20,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash 481145829, now seen corresponding path program 1 times [2024-10-12 22:28:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855932295] [2024-10-12 22:28:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:20,536 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-12 22:28:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855932295] [2024-10-12 22:28:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855932295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004484767] [2024-10-12 22:28:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:20,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:20,540 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:20,672 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-10-12 22:28:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:28:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-12 22:28:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:20,673 INFO L225 Difference]: With dead ends: 216 [2024-10-12 22:28:20,674 INFO L226 Difference]: Without dead ends: 90 [2024-10-12 22:28:20,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:20,677 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 57 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:20,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 355 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-12 22:28:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-12 22:28:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-10-12 22:28:20,685 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 41 [2024-10-12 22:28:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:20,685 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-10-12 22:28:20,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-10-12 22:28:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 22:28:20,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:20,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:20,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:28:20,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:20,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1108563902, now seen corresponding path program 1 times [2024-10-12 22:28:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:20,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370655672] [2024-10-12 22:28:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:20,895 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-12 22:28:20,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370655672] [2024-10-12 22:28:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370655672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:20,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:20,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:20,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433925908] [2024-10-12 22:28:20,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:20,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:20,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:20,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:20,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:20,899 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:20,976 INFO L93 Difference]: Finished difference Result 177 states and 250 transitions. [2024-10-12 22:28:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:28:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-12 22:28:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:20,978 INFO L225 Difference]: With dead ends: 177 [2024-10-12 22:28:20,978 INFO L226 Difference]: Without dead ends: 90 [2024-10-12 22:28:20,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12 22:28:20,980 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:20,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 308 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-12 22:28:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-12 22:28:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-12 22:28:20,990 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 42 [2024-10-12 22:28:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:20,990 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-12 22:28:20,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-12 22:28:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 22:28:20,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:20,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:20,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:28:20,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:20,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash -74143529, now seen corresponding path program 1 times [2024-10-12 22:28:20,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:20,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83502071] [2024-10-12 22:28:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:20,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:21,323 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-12 22:28:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:21,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83502071] [2024-10-12 22:28:21,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83502071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:21,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:21,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:28:21,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132146746] [2024-10-12 22:28:21,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:21,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:28:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:28:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:21,325 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:21,462 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2024-10-12 22:28:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:28:21,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-12 22:28:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:21,463 INFO L225 Difference]: With dead ends: 167 [2024-10-12 22:28:21,463 INFO L226 Difference]: Without dead ends: 94 [2024-10-12 22:28:21,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:21,464 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 122 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:21,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 208 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-12 22:28:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-12 22:28:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-12 22:28:21,478 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 43 [2024-10-12 22:28:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:21,478 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-12 22:28:21,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-12 22:28:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 22:28:21,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:21,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:21,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:28:21,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:21,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1751650330, now seen corresponding path program 1 times [2024-10-12 22:28:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:21,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441871950] [2024-10-12 22:28:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:21,831 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-12 22:28:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441871950] [2024-10-12 22:28:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441871950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404034779] [2024-10-12 22:28:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:21,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:28:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:21,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:28:21,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:21,834 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:21,969 INFO L93 Difference]: Finished difference Result 173 states and 240 transitions. [2024-10-12 22:28:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:28:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-12 22:28:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:21,971 INFO L225 Difference]: With dead ends: 173 [2024-10-12 22:28:21,971 INFO L226 Difference]: Without dead ends: 97 [2024-10-12 22:28:21,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:28:21,972 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:21,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-12 22:28:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-12 22:28:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-10-12 22:28:21,985 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 44 [2024-10-12 22:28:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-10-12 22:28:21,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-10-12 22:28:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 22:28:21,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:21,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:21,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:28:21,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:21,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2009691195, now seen corresponding path program 1 times [2024-10-12 22:28:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:21,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137394973] [2024-10-12 22:28:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:22,435 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-12 22:28:22,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137394973] [2024-10-12 22:28:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137394973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:28:22,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858483268] [2024-10-12 22:28:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:22,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:28:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:22,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:28:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:28:22,440 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:22,560 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2024-10-12 22:28:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:28:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-12 22:28:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:22,563 INFO L225 Difference]: With dead ends: 179 [2024-10-12 22:28:22,563 INFO L226 Difference]: Without dead ends: 100 [2024-10-12 22:28:22,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:28:22,566 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:22,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 500 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-12 22:28:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-12 22:28:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-10-12 22:28:22,581 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 44 [2024-10-12 22:28:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:22,581 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-10-12 22:28:22,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-10-12 22:28:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 22:28:22,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:22,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 22:28:22,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:22,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -288999782, now seen corresponding path program 1 times [2024-10-12 22:28:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:22,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612212442] [2024-10-12 22:28:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:22,939 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-12 22:28:22,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:22,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612212442] [2024-10-12 22:28:22,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612212442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:22,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:22,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:28:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504260126] [2024-10-12 22:28:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:22,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:28:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:28:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:28:22,942 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:23,067 INFO L93 Difference]: Finished difference Result 187 states and 257 transitions. [2024-10-12 22:28:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:28:23,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 22:28:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:23,068 INFO L225 Difference]: With dead ends: 187 [2024-10-12 22:28:23,068 INFO L226 Difference]: Without dead ends: 106 [2024-10-12 22:28:23,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:28:23,069 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:23,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 594 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-12 22:28:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-12 22:28:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-10-12 22:28:23,082 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 45 [2024-10-12 22:28:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:23,082 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-10-12 22:28:23,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-10-12 22:28:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 22:28:23,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:23,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 22:28:23,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:23,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 684998491, now seen corresponding path program 1 times [2024-10-12 22:28:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256190345] [2024-10-12 22:28:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:23,367 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-12 22:28:23,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256190345] [2024-10-12 22:28:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256190345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:23,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248202845] [2024-10-12 22:28:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:23,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:28:23,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:28:23,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:23,370 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:23,505 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2024-10-12 22:28:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:28:23,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 22:28:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:23,506 INFO L225 Difference]: With dead ends: 193 [2024-10-12 22:28:23,507 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 22:28:23,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:28:23,508 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:23,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 212 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 22:28:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-12 22:28:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2024-10-12 22:28:23,517 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 46 [2024-10-12 22:28:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:23,517 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2024-10-12 22:28:23,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2024-10-12 22:28:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 22:28:23,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:23,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:23,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 22:28:23,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:23,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1472251206, now seen corresponding path program 1 times [2024-10-12 22:28:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:23,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637997340] [2024-10-12 22:28:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:23,655 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-12 22:28:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637997340] [2024-10-12 22:28:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637997340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:23,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:28:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588679485] [2024-10-12 22:28:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:28:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:28:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:23,659 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:23,714 INFO L93 Difference]: Finished difference Result 196 states and 265 transitions. [2024-10-12 22:28:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:28:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 22:28:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:23,715 INFO L225 Difference]: With dead ends: 196 [2024-10-12 22:28:23,716 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 22:28:23,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:28:23,717 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 106 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 324 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:23,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 324 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 22:28:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-12 22:28:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2024-10-12 22:28:23,722 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 46 [2024-10-12 22:28:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:23,722 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2024-10-12 22:28:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2024-10-12 22:28:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 22:28:23,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:23,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:23,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 22:28:23,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1418305066, now seen corresponding path program 1 times [2024-10-12 22:28:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:23,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106238325] [2024-10-12 22:28:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:24,015 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-12 22:28:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:24,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106238325] [2024-10-12 22:28:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106238325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:24,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:28:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343333906] [2024-10-12 22:28:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:28:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:28:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:28:24,017 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:24,064 INFO L93 Difference]: Finished difference Result 227 states and 304 transitions. [2024-10-12 22:28:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:28:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 22:28:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:24,066 INFO L225 Difference]: With dead ends: 227 [2024-10-12 22:28:24,066 INFO L226 Difference]: Without dead ends: 137 [2024-10-12 22:28:24,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:28:24,067 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 151 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:24,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 458 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-12 22:28:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-10-12 22:28:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 133 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2024-10-12 22:28:24,075 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 46 [2024-10-12 22:28:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:24,075 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2024-10-12 22:28:24,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2024-10-12 22:28:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 22:28:24,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:24,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:24,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 22:28:24,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:24,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:24,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1476152806, now seen corresponding path program 1 times [2024-10-12 22:28:24,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680626799] [2024-10-12 22:28:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:24,238 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-12 22:28:24,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:24,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680626799] [2024-10-12 22:28:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680626799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:24,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:28:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329995298] [2024-10-12 22:28:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:24,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:24,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:24,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:24,240 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:24,330 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2024-10-12 22:28:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:28:24,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 22:28:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:24,331 INFO L225 Difference]: With dead ends: 248 [2024-10-12 22:28:24,331 INFO L226 Difference]: Without dead ends: 131 [2024-10-12 22:28:24,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:24,332 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 104 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:24,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 146 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-12 22:28:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-12 22:28:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.3384615384615384) internal successors, (174), 130 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2024-10-12 22:28:24,336 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 46 [2024-10-12 22:28:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:24,336 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2024-10-12 22:28:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-10-12 22:28:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 22:28:24,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:24,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 22:28:24,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash -153595182, now seen corresponding path program 1 times [2024-10-12 22:28:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353248515] [2024-10-12 22:28:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:24,626 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-12 22:28:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353248515] [2024-10-12 22:28:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353248515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:28:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662380662] [2024-10-12 22:28:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:24,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:28:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:28:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:28:24,628 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:24,718 INFO L93 Difference]: Finished difference Result 347 states and 454 transitions. [2024-10-12 22:28:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:28:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-12 22:28:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:24,719 INFO L225 Difference]: With dead ends: 347 [2024-10-12 22:28:24,719 INFO L226 Difference]: Without dead ends: 233 [2024-10-12 22:28:24,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:28:24,720 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 288 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:24,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 448 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-12 22:28:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 214. [2024-10-12 22:28:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.3145539906103287) internal successors, (280), 213 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2024-10-12 22:28:24,731 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 47 [2024-10-12 22:28:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:24,731 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2024-10-12 22:28:24,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2024-10-12 22:28:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 22:28:24,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:24,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:24,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 22:28:24,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:24,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash 442403676, now seen corresponding path program 1 times [2024-10-12 22:28:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835914776] [2024-10-12 22:28:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:24,976 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-12 22:28:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835914776] [2024-10-12 22:28:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835914776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:28:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001040745] [2024-10-12 22:28:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:28:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:24,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:28:24,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:28:24,978 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:25,090 INFO L93 Difference]: Finished difference Result 349 states and 456 transitions. [2024-10-12 22:28:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:28:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-12 22:28:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:25,091 INFO L225 Difference]: With dead ends: 349 [2024-10-12 22:28:25,092 INFO L226 Difference]: Without dead ends: 235 [2024-10-12 22:28:25,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-12 22:28:25,092 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 291 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:25,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 660 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-12 22:28:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2024-10-12 22:28:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-10-12 22:28:25,098 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 48 [2024-10-12 22:28:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:25,098 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-10-12 22:28:25,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-10-12 22:28:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 22:28:25,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:25,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 22:28:25,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1148958575, now seen corresponding path program 1 times [2024-10-12 22:28:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45806476] [2024-10-12 22:28:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:25,409 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-12 22:28:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45806476] [2024-10-12 22:28:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45806476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:25,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:25,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:28:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880266736] [2024-10-12 22:28:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:25,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:28:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:28:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:28:25,412 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:25,491 INFO L93 Difference]: Finished difference Result 344 states and 451 transitions. [2024-10-12 22:28:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:28:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 22:28:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:25,492 INFO L225 Difference]: With dead ends: 344 [2024-10-12 22:28:25,492 INFO L226 Difference]: Without dead ends: 225 [2024-10-12 22:28:25,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:28:25,493 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 105 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:25,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 487 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-12 22:28:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2024-10-12 22:28:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-10-12 22:28:25,498 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 49 [2024-10-12 22:28:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:25,499 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-10-12 22:28:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-10-12 22:28:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 22:28:25,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:25,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:25,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 22:28:25,500 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:25,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash 447774336, now seen corresponding path program 1 times [2024-10-12 22:28:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:25,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940629287] [2024-10-12 22:28:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:25,899 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-12 22:28:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940629287] [2024-10-12 22:28:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940629287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:28:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415573690] [2024-10-12 22:28:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 22:28:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 22:28:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:28:25,901 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:26,061 INFO L93 Difference]: Finished difference Result 349 states and 455 transitions. [2024-10-12 22:28:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 22:28:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 22:28:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:26,062 INFO L225 Difference]: With dead ends: 349 [2024-10-12 22:28:26,063 INFO L226 Difference]: Without dead ends: 235 [2024-10-12 22:28:26,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:28:26,064 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 284 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:26,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 747 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-12 22:28:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2024-10-12 22:28:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 220 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2024-10-12 22:28:26,069 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 50 [2024-10-12 22:28:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:26,069 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2024-10-12 22:28:26,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2024-10-12 22:28:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 22:28:26,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:26,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:26,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 22:28:26,070 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1734319446, now seen corresponding path program 1 times [2024-10-12 22:28:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:26,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696719869] [2024-10-12 22:28:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:26,487 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-12 22:28:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696719869] [2024-10-12 22:28:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696719869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:28:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887536232] [2024-10-12 22:28:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 22:28:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 22:28:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:28:26,490 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:26,961 INFO L93 Difference]: Finished difference Result 498 states and 648 transitions. [2024-10-12 22:28:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 22:28:26,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-12 22:28:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:26,962 INFO L225 Difference]: With dead ends: 498 [2024-10-12 22:28:26,963 INFO L226 Difference]: Without dead ends: 365 [2024-10-12 22:28:26,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 22:28:26,963 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 194 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:26,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 449 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:28:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-12 22:28:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 317. [2024-10-12 22:28:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.3037974683544304) internal successors, (412), 316 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 412 transitions. [2024-10-12 22:28:26,970 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 412 transitions. Word has length 51 [2024-10-12 22:28:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:26,971 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 412 transitions. [2024-10-12 22:28:26,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 412 transitions. [2024-10-12 22:28:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 22:28:26,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:26,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:26,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 22:28:26,972 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1464730182, now seen corresponding path program 1 times [2024-10-12 22:28:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111821744] [2024-10-12 22:28:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:27,477 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-12 22:28:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111821744] [2024-10-12 22:28:27,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111821744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:27,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:27,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:28:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895068903] [2024-10-12 22:28:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:27,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:28:27,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:27,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:28:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:28:27,481 INFO L87 Difference]: Start difference. First operand 317 states and 412 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:27,826 INFO L93 Difference]: Finished difference Result 319 states and 413 transitions. [2024-10-12 22:28:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:28:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-12 22:28:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:27,828 INFO L225 Difference]: With dead ends: 319 [2024-10-12 22:28:27,828 INFO L226 Difference]: Without dead ends: 221 [2024-10-12 22:28:27,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 22:28:27,829 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 118 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:27,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 318 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:28:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-12 22:28:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-10-12 22:28:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 220 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2024-10-12 22:28:27,834 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 51 [2024-10-12 22:28:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:27,835 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2024-10-12 22:28:27,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2024-10-12 22:28:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 22:28:27,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:27,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:27,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 22:28:27,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1902566382, now seen corresponding path program 1 times [2024-10-12 22:28:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243093336] [2024-10-12 22:28:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:28,054 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-12 22:28:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243093336] [2024-10-12 22:28:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243093336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:28:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202706583] [2024-10-12 22:28:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:28,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:28:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:28:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:28:28,057 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:28,163 INFO L93 Difference]: Finished difference Result 348 states and 449 transitions. [2024-10-12 22:28:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:28:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 22:28:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:28,164 INFO L225 Difference]: With dead ends: 348 [2024-10-12 22:28:28,164 INFO L226 Difference]: Without dead ends: 225 [2024-10-12 22:28:28,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 22:28:28,165 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 120 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:28,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 487 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-12 22:28:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-12 22:28:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2927927927927927) internal successors, (287), 222 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 287 transitions. [2024-10-12 22:28:28,171 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 287 transitions. Word has length 52 [2024-10-12 22:28:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 287 transitions. [2024-10-12 22:28:28,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 287 transitions. [2024-10-12 22:28:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 22:28:28,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:28,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:28,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 22:28:28,172 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:28,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1296483246, now seen corresponding path program 1 times [2024-10-12 22:28:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444634498] [2024-10-12 22:28:28,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:28,601 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-12 22:28:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:28:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444634498] [2024-10-12 22:28:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444634498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:28:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071010593] [2024-10-12 22:28:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 22:28:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:28:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 22:28:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:28:28,603 INFO L87 Difference]: Start difference. First operand 223 states and 287 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:28,886 INFO L93 Difference]: Finished difference Result 351 states and 450 transitions. [2024-10-12 22:28:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 22:28:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 22:28:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:28,888 INFO L225 Difference]: With dead ends: 351 [2024-10-12 22:28:28,888 INFO L226 Difference]: Without dead ends: 223 [2024-10-12 22:28:28,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:28:28,889 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 83 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:28,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 310 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:28:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-12 22:28:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 163. [2024-10-12 22:28:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 162 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2024-10-12 22:28:28,894 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 52 [2024-10-12 22:28:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:28,894 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2024-10-12 22:28:28,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2024-10-12 22:28:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 22:28:28,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:28,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:28:28,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 22:28:28,895 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:28,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1955507242, now seen corresponding path program 1 times [2024-10-12 22:28:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:28:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690882889] [2024-10-12 22:28:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:28:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:28:28,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 22:28:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:28:28,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 22:28:28,995 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 22:28:28,996 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:28:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 22:28:29,000 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:28:29,063 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:28:29,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:28:29 BoogieIcfgContainer [2024-10-12 22:28:29,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:28:29,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:28:29,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:28:29,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:28:29,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:28:18" (3/4) ... [2024-10-12 22:28:29,069 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 22:28:29,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:28:29,071 INFO L158 Benchmark]: Toolchain (without parser) took 11978.21ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 134.6MB in the beginning and 185.7MB in the end (delta: -51.1MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2024-10-12 22:28:29,071 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:28:29,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.70ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 117.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 22:28:29,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.27ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 108.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 22:28:29,072 INFO L158 Benchmark]: Boogie Preprocessor took 129.32ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 102.6MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 22:28:29,075 INFO L158 Benchmark]: RCFGBuilder took 829.75ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 51.5MB in the end (delta: 51.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-12 22:28:29,075 INFO L158 Benchmark]: TraceAbstraction took 10584.94ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 50.9MB in the beginning and 185.7MB in the end (delta: -134.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-10-12 22:28:29,075 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 327.2MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:28:29,076 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.19ms. Allocated memory is still 167.8MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.70ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 117.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.27ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 108.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.32ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 102.6MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 829.75ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 51.5MB in the end (delta: 51.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10584.94ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 50.9MB in the beginning and 185.7MB in the end (delta: -134.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 327.2MB. Free memory is still 185.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 123, overapproximation of bitwiseAnd at line 128. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 2); [L33] const SORT_27 msb_SORT_27 = (SORT_27)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_24 = 1; [L39] const SORT_1 var_41 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L53] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_31_arg_1 = var_15; [L62] state_30 = init_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_41=1] [L83] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_21=2, var_24=1, var_41=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_25_arg_0 = var_20; [L85] SORT_5 var_25_arg_1 = var_24; [L86] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L87] SORT_1 var_26_arg_0 = var_25; [L88] SORT_1 var_26 = ~var_26_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_23_arg_0 = var_22; [L93] SORT_1 var_23 = ~var_23_arg_0; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_23=-1, var_24=1, var_26=-1, var_41=1] [L94] EXPR var_23 & mask_SORT_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 var_28_arg_0 = var_26; [L96] SORT_1 var_28_arg_1 = var_23; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_28_arg_0=-1, var_28_arg_1=0, var_41=1] [L97] EXPR ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L97] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1; [L98] EXPR var_28 & mask_SORT_27 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L98] var_28 = var_28 & mask_SORT_27 [L99] SORT_27 var_29_arg_0 = var_28; [L100] SORT_1 var_29 = var_29_arg_0 == mask_SORT_27; [L101] SORT_1 var_32_arg_0 = state_18; [L102] SORT_5 var_32_arg_1 = state_30; [L103] SORT_5 var_32_arg_2 = input_7; [L104] SORT_5 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_32=0, var_41=1] [L105] EXPR var_32 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_41=1] [L105] var_32 = var_32 & mask_SORT_5 [L106] SORT_5 var_33_arg_0 = var_32; [L107] SORT_5 var_33_arg_1 = var_21; [L108] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_1 var_34 = ~var_34_arg_0; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_32=0, var_34=-1, var_41=1] [L111] EXPR var_34 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_32=0, var_41=1] [L111] var_34 = var_34 & mask_SORT_1 [L112] SORT_1 var_35_arg_0 = var_26; [L113] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=0, var_32=0, var_35_arg_0=-1, var_35_arg_1=0, var_41=1] [L114] EXPR ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=0, var_32=0, var_41=1] [L114] SORT_27 var_35 = ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1; [L115] EXPR var_35 & mask_SORT_27 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=0, var_32=0, var_41=1] [L115] var_35 = var_35 & mask_SORT_27 [L116] SORT_27 var_36_arg_0 = var_35; [L117] SORT_1 var_36 = var_36_arg_0 == mask_SORT_27; [L118] SORT_1 var_37_arg_0 = var_29; [L119] SORT_1 var_37_arg_1 = var_36; [L120] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L121] SORT_1 var_38_arg_0 = var_14; [L122] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_38_arg_0=-1, var_38_arg_1=1, var_41=1] [L123] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L123] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L124] SORT_1 var_42_arg_0 = var_38; [L125] SORT_1 var_42 = ~var_42_arg_0; [L126] SORT_1 var_43_arg_0 = var_41; [L127] SORT_1 var_43_arg_1 = var_42; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1, var_43_arg_0=1, var_43_arg_1=-1] [L128] EXPR var_43_arg_0 & var_43_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L128] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L129] EXPR var_43 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L129] var_43 = var_43 & mask_SORT_1 [L130] SORT_1 bad_44_arg_0 = var_43; [L131] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2517 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2517 mSDsluCounter, 8271 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6221 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2711 IncrementalHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 2050 mSDtfsCounter, 2711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=18, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 180 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 4617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2024-10-12 22:28:29,112 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:28:31,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:28:31,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 22:28:31,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:28:31,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:28:31,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:28:31,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:28:31,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:28:31,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:28:31,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:28:31,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:28:31,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:28:31,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:28:31,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:28:31,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:28:31,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:28:31,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:28:31,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:28:31,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:28:31,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:28:31,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:28:31,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 22:28:31,343 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 22:28:31,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:28:31,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 22:28:31,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:28:31,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:28:31,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:28:31,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:28:31,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:28:31,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:28:31,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:28:31,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:28:31,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:28:31,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:28:31,348 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 22:28:31,348 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 22:28:31,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:28:31,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:28:31,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:28:31,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:28:31,349 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 22:28:31,349 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2024-10-12 22:28:31,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:28:31,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:28:31,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:28:31,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:28:31,711 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:28:31,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-12 22:28:33,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:28:33,518 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:28:33,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-12 22:28:33,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ff04d9b/21e36f76c4bb48e5a079f12aec04d868/FLAG804f15903 [2024-10-12 22:28:33,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ff04d9b/21e36f76c4bb48e5a079f12aec04d868 [2024-10-12 22:28:33,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:28:33,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:28:33,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:28:33,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:28:33,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:28:33,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:28:33" (1/1) ... [2024-10-12 22:28:33,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6891a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:33, skipping insertion in model container [2024-10-12 22:28:33,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:28:33" (1/1) ... [2024-10-12 22:28:33,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:28:34,111 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/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-12 22:28:34,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:28:34,200 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:28:34,215 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/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-12 22:28:34,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:28:34,283 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:28:34,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34 WrapperNode [2024-10-12 22:28:34,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:28:34,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:28:34,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:28:34,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:28:34,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,333 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 210 [2024-10-12 22:28:34,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:28:34,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:28:34,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:28:34,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:28:34,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,380 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 22:28:34,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:28:34,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:28:34,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:28:34,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:28:34,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (1/1) ... [2024-10-12 22:28:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:28:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:28:34,450 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-12 22:28:34,453 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-12 22:28:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:28:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 22:28:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 22:28:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:28:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:28:34,622 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:28:34,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:28:34,933 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-12 22:28:34,934 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:28:34,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:28:34,996 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:28:34,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:28:34 BoogieIcfgContainer [2024-10-12 22:28:34,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:28:34,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:28:34,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:28:35,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:28:35,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:28:33" (1/3) ... [2024-10-12 22:28:35,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afdae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:28:35, skipping insertion in model container [2024-10-12 22:28:35,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:28:34" (2/3) ... [2024-10-12 22:28:35,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afdae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:28:35, skipping insertion in model container [2024-10-12 22:28:35,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:28:34" (3/3) ... [2024-10-12 22:28:35,005 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2024-10-12 22:28:35,020 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:28:35,021 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:28:35,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:28:35,087 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;@732c565f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:28:35,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:28:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 22:28:35,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:35,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 22:28:35,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:35,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 22:28:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:28:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639695011] [2024-10-12 22:28:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:35,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:28:35,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:28:35,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:28:35,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 22:28:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:35,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 22:28:35,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:28:35,406 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-12 22:28:35,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:28:35,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:28:35,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639695011] [2024-10-12 22:28:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639695011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:28:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:28:35,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:28:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998188284] [2024-10-12 22:28:35,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:28:35,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:28:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:28:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:28:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:28:35,439 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:35,501 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 22:28:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:28:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-12 22:28:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:35,509 INFO L225 Difference]: With dead ends: 15 [2024-10-12 22:28:35,510 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 22:28:35,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:28:35,515 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:35,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:28:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 22:28:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 22:28:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 22:28:35,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 22:28:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:35,545 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 22:28:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 22:28:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 22:28:35,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:35,546 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 22:28:35,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 22:28:35,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:28:35,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:35,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 22:28:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:28:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341453071] [2024-10-12 22:28:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:28:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:28:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:28:35,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:28:35,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 22:28:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:28:35,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-12 22:28:35,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:28:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:28:36,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:28:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:28:43,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:28:43,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341453071] [2024-10-12 22:28:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341453071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:28:43,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:28:43,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 22:28:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533589832] [2024-10-12 22:28:43,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:28:43,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:28:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:28:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:28:43,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:28:43,392 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:28:43,484 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-12 22:28:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:28:43,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 22:28:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:28:43,485 INFO L225 Difference]: With dead ends: 13 [2024-10-12 22:28:43,485 INFO L226 Difference]: Without dead ends: 11 [2024-10-12 22:28:43,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:28:43,487 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:28:43,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:28:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-12 22:28:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 22:28:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 22:28:43,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 22:28:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:28:43,491 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 22:28:43,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:28:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 22:28:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 22:28:43,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:28:43,492 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 22:28:43,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 22:28:43,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:28:43,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:28:43,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:28:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 22:28:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:28:43,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31199968] [2024-10-12 22:28:43,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 22:28:43,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:28:43,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:28:43,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:28:43,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 22:28:43,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 22:28:43,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:28:43,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-12 22:28:43,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:28:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:28:45,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:29:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:29:13,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:29:13,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31199968] [2024-10-12 22:29:13,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31199968] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:29:13,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:29:13,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-12 22:29:13,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529262016] [2024-10-12 22:29:13,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:29:13,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 22:29:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:29:13,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 22:29:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:29:13,939 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:29:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:29:14,228 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-12 22:29:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 22:29:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 22:29:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:29:14,229 INFO L225 Difference]: With dead ends: 16 [2024-10-12 22:29:14,229 INFO L226 Difference]: Without dead ends: 14 [2024-10-12 22:29:14,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:29:14,231 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:29:14,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:29:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-12 22:29:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-12 22:29:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:29:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 22:29:14,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-12 22:29:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:29:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 22:29:14,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:29:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 22:29:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 22:29:14,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:29:14,237 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 22:29:14,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 22:29:14,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:29:14,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:29:14,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:29:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-12 22:29:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:29:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110745095] [2024-10-12 22:29:14,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 22:29:14,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:29:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:29:14,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:29:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 22:29:14,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 22:29:14,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:29:14,621 WARN L253 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-10-12 22:29:14,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:29:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 22:29:16,624 INFO L311 TraceCheckSpWp]: Computing backward predicates...