./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fee064ce0c405db918781b572b48c244fa7620ae3f5c3339ec0ff1c22b3afd29 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:53:35,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:53:35,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:53:35,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:53:35,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:53:35,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:53:35,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:53:35,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:53:35,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:53:35,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:53:35,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:53:35,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:53:35,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:53:35,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:53:35,465 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:53:35,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:53:35,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:53:35,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:53:35,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:53:35,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:53:35,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:53:35,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:53:35,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:53:35,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:53:35,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:35,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:35,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:53:35,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:53:35,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:53:35,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:53:35,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fee064ce0c405db918781b572b48c244fa7620ae3f5c3339ec0ff1c22b3afd29 [2025-04-29 10:53:35,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:53:35,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:53:35,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:53:35,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:53:35,692 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:53:35,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.c [2025-04-29 10:53:37,004 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a194854b7/74cf06d35e2945f79da7fba80afc6405/FLAGa2806b332 [2025-04-29 10:53:37,212 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:53:37,213 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.c [2025-04-29 10:53:37,219 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:53:37,219 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:53:37,226 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a194854b7/74cf06d35e2945f79da7fba80afc6405/FLAGa2806b332 [2025-04-29 10:53:38,005 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a194854b7/74cf06d35e2945f79da7fba80afc6405 [2025-04-29 10:53:38,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:53:38,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:53:38,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:53:38,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:53:38,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:53:38,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c41a043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38, skipping insertion in model container [2025-04-29 10:53:38,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:53:38,161 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.c[1822,1835] [2025-04-29 10:53:38,164 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:53:38,171 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:53:38,194 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.c[1822,1835] [2025-04-29 10:53:38,195 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:53:38,203 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:53:38,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38 WrapperNode [2025-04-29 10:53:38,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:53:38,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:53:38,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:53:38,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:53:38,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,242 INFO L138 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2025-04-29 10:53:38,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:53:38,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:53:38,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:53:38,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:53:38,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,271 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [6, 5]. 55 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 4 writes are split as follows [3, 1]. [2025-04-29 10:53:38,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:53:38,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:53:38,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:53:38,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:53:38,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (1/1) ... [2025-04-29 10:53:38,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:38,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:38,315 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) [2025-04-29 10:53:38,317 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 [2025-04-29 10:53:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:53:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:53:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:53:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:53:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:53:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:53:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:53:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:53:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 10:53:38,333 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 10:53:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2025-04-29 10:53:38,333 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2025-04-29 10:53:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:53:38,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:53:38,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:53:38,389 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:53:38,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:53:38,412 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 10:53:38,560 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-04-29 10:53:38,560 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:53:38,570 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:53:38,570 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 10:53:38,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:53:38 BoogieIcfgContainer [2025-04-29 10:53:38,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:53:38,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:53:38,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:53:38,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:53:38,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:53:38" (1/3) ... [2025-04-29 10:53:38,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a209ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:53:38, skipping insertion in model container [2025-04-29 10:53:38,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:38" (2/3) ... [2025-04-29 10:53:38,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a209ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:53:38, skipping insertion in model container [2025-04-29 10:53:38,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:53:38" (3/3) ... [2025-04-29 10:53:38,579 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-2.c [2025-04-29 10:53:38,588 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:53:38,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_nondet_insert-2.c that has 3 procedures, 47 locations, 68 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-29 10:53:38,626 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:53:38,633 INFO L340 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;@726c57c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:53:38,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:53:38,635 INFO L278 IsEmpty]: Start isEmpty. Operand has 46 states, 38 states have (on average 1.394736842105263) internal successors, (53), 40 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:53:38,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:53:38,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:38,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:38,640 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:38,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 655963720, now seen corresponding path program 1 times [2025-04-29 10:53:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:38,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655717920] [2025-04-29 10:53:38,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:53:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:53:38,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:38,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:53:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:38,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655717920] [2025-04-29 10:53:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655717920] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:38,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123517024] [2025-04-29 10:53:38,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:38,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:38,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:53:38,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:53:38,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:53:38,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:38,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:38,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-29 10:53:38,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:53:38,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:53:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123517024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:53:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-04-29 10:53:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57971089] [2025-04-29 10:53:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:38,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:53:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:38,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:53:38,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:53:38,867 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.394736842105263) internal successors, (53), 40 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:53:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:38,884 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2025-04-29 10:53:38,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:53:38,886 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-04-29 10:53:38,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:38,889 INFO L225 Difference]: With dead ends: 89 [2025-04-29 10:53:38,889 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 10:53:38,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:53:38,893 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:38,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 10:53:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-29 10:53:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:53:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-04-29 10:53:38,916 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 24 [2025-04-29 10:53:38,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:38,917 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-04-29 10:53:38,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:53:38,917 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-04-29 10:53:38,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 10:53:38,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:38,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:38,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:53:39,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-04-29 10:53:39,118 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:39,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash -607252648, now seen corresponding path program 1 times [2025-04-29 10:53:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:39,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012478371] [2025-04-29 10:53:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:39,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:53:39,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:53:39,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:39,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:53:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:39,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012478371] [2025-04-29 10:53:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012478371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:39,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653874065] [2025-04-29 10:53:39,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:39,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:39,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:39,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:39,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:53:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:53:39,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:53:39,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:39,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:53:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:39,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:53:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653874065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:39,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:53:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2025-04-29 10:53:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749603093] [2025-04-29 10:53:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:39,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:53:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:39,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:53:39,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:53:39,497 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:53:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:39,560 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-04-29 10:53:39,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:53:39,561 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-04-29 10:53:39,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:39,562 INFO L225 Difference]: With dead ends: 67 [2025-04-29 10:53:39,562 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 10:53:39,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:53:39,562 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:39,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 10:53:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-29 10:53:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:53:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-04-29 10:53:39,569 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 29 [2025-04-29 10:53:39,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:39,570 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-04-29 10:53:39,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:53:39,571 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-04-29 10:53:39,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:53:39,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:39,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:39,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:53:39,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-29 10:53:39,778 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:39,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1817091888, now seen corresponding path program 1 times [2025-04-29 10:53:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:39,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957212580] [2025-04-29 10:53:39,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:39,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:53:39,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:53:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:53:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:39,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957212580] [2025-04-29 10:53:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957212580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:39,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 10:53:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049130312] [2025-04-29 10:53:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:39,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:53:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:53:39,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:53:39,897 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:53:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:39,978 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-04-29 10:53:39,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:53:39,979 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-04-29 10:53:39,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:39,979 INFO L225 Difference]: With dead ends: 63 [2025-04-29 10:53:39,979 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 10:53:39,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:53:39,980 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:39,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 218 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 10:53:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-04-29 10:53:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:53:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-04-29 10:53:39,984 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 34 [2025-04-29 10:53:39,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:39,984 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-04-29 10:53:39,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:53:39,985 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-04-29 10:53:39,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:53:39,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:39,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:39,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:53:39,986 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:39,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash -497183439, now seen corresponding path program 1 times [2025-04-29 10:53:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:39,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61151622] [2025-04-29 10:53:39,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:39,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:53:40,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:53:40,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:53:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:40,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61151622] [2025-04-29 10:53:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61151622] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:40,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947675357] [2025-04-29 10:53:40,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:40,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:40,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:40,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:53:40,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:53:40,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:53:40,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:40,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:40,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:53:40,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:53:40,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:53:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947675357] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:40,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-04-29 10:53:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356709943] [2025-04-29 10:53:40,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:40,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:53:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:40,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:53:40,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:53:40,379 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:53:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:40,475 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2025-04-29 10:53:40,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 10:53:40,476 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-04-29 10:53:40,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:40,476 INFO L225 Difference]: With dead ends: 102 [2025-04-29 10:53:40,477 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 10:53:40,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:53:40,477 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:40,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 289 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 10:53:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2025-04-29 10:53:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:53:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-04-29 10:53:40,482 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 35 [2025-04-29 10:53:40,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:40,482 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-04-29 10:53:40,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:53:40,482 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-04-29 10:53:40,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:53:40,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:40,483 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:40,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 10:53:40,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:40,687 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:40,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2001998679, now seen corresponding path program 2 times [2025-04-29 10:53:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:40,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918079351] [2025-04-29 10:53:40,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:53:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:40,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:53:40,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:53:40,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:53:40,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:53:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:40,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918079351] [2025-04-29 10:53:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918079351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:40,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556732138] [2025-04-29 10:53:40,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:53:40,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:40,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:40,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:53:40,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:53:40,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:53:40,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:53:40,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:40,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 10:53:40,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:41,046 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:53:41,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-29 10:53:41,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 10:53:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:41,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:41,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-04-29 10:53:41,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-29 10:53:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:53:41,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556732138] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:41,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:41,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 15 [2025-04-29 10:53:41,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431686621] [2025-04-29 10:53:41,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:41,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 10:53:41,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:41,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 10:53:41,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-29 10:53:41,309 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:53:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:41,493 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2025-04-29 10:53:41,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:53:41,494 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2025-04-29 10:53:41,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:41,495 INFO L225 Difference]: With dead ends: 87 [2025-04-29 10:53:41,495 INFO L226 Difference]: Without dead ends: 83 [2025-04-29 10:53:41,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:53:41,496 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:41,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 557 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-29 10:53:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2025-04-29 10:53:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 60 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:53:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-04-29 10:53:41,509 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 40 [2025-04-29 10:53:41,509 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:41,509 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-04-29 10:53:41,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:53:41,510 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-04-29 10:53:41,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 10:53:41,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:41,512 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:41,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:53:41,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:41,712 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:41,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1934326664, now seen corresponding path program 3 times [2025-04-29 10:53:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:41,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381668593] [2025-04-29 10:53:41,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:53:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:41,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-29 10:53:41,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 41 statements. [2025-04-29 10:53:41,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:53:41,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:53:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:41,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381668593] [2025-04-29 10:53:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381668593] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:41,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758802298] [2025-04-29 10:53:41,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:53:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:41,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:41,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:53:41,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-04-29 10:53:41,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 41 statements. [2025-04-29 10:53:41,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:53:41,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:41,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 10:53:41,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:53:42,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:53:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758802298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:42,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 28 [2025-04-29 10:53:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965027076] [2025-04-29 10:53:42,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:42,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 10:53:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:42,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 10:53:42,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-29 10:53:42,365 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:53:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:42,648 INFO L93 Difference]: Finished difference Result 176 states and 235 transitions. [2025-04-29 10:53:42,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 10:53:42,648 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-04-29 10:53:42,649 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:42,650 INFO L225 Difference]: With dead ends: 176 [2025-04-29 10:53:42,650 INFO L226 Difference]: Without dead ends: 172 [2025-04-29 10:53:42,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2025-04-29 10:53:42,652 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 67 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:42,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 636 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:53:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-29 10:53:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2025-04-29 10:53:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 113 states have internal predecessors, (137), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (18), 8 states have call predecessors, (18), 9 states have call successors, (18) [2025-04-29 10:53:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2025-04-29 10:53:42,668 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 41 [2025-04-29 10:53:42,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:42,669 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2025-04-29 10:53:42,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:53:42,669 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2025-04-29 10:53:42,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:53:42,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:42,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:42,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:53:42,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:42,874 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:42,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 163505801, now seen corresponding path program 4 times [2025-04-29 10:53:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:42,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512008506] [2025-04-29 10:53:42,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:53:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:42,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-29 10:53:42,892 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:53:42,892 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:53:42,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:53:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:43,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512008506] [2025-04-29 10:53:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512008506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:43,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773053226] [2025-04-29 10:53:43,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:53:43,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:43,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:43,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:53:43,437 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-29 10:53:43,456 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:53:43,457 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:53:43,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:43,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-29 10:53:43,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:43,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:53:43,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:53:43,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:53:43,555 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:53:43,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:53:43,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-29 10:53:43,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 10:53:43,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-04-29 10:53:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:43,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:44,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2025-04-29 10:53:44,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2025-04-29 10:53:48,194 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_23|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0)))) is different from false [2025-04-29 10:53:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2025-04-29 10:53:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773053226] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:48,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 31 [2025-04-29 10:53:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729819135] [2025-04-29 10:53:48,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:48,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 10:53:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:48,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 10:53:48,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=789, Unknown=1, NotChecked=56, Total=930 [2025-04-29 10:53:48,406 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:54:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:01,153 INFO L93 Difference]: Finished difference Result 195 states and 251 transitions. [2025-04-29 10:54:01,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:54:01,154 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2025-04-29 10:54:01,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:01,155 INFO L225 Difference]: With dead ends: 195 [2025-04-29 10:54:01,157 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 10:54:01,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=117, Invalid=1008, Unknown=1, NotChecked=64, Total=1190 [2025-04-29 10:54:01,165 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:01,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 887 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 412 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2025-04-29 10:54:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 10:54:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2025-04-29 10:54:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 149 states have internal predecessors, (177), 13 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (26), 10 states have call predecessors, (26), 13 states have call successors, (26) [2025-04-29 10:54:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 216 transitions. [2025-04-29 10:54:01,186 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 216 transitions. Word has length 42 [2025-04-29 10:54:01,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:01,186 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 216 transitions. [2025-04-29 10:54:01,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:54:01,187 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 216 transitions. [2025-04-29 10:54:01,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 10:54:01,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:01,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:01,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:01,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:01,392 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:01,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash -116095055, now seen corresponding path program 1 times [2025-04-29 10:54:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:01,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915930099] [2025-04-29 10:54:01,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:01,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 10:54:01,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:54:01,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:01,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:54:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:01,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915930099] [2025-04-29 10:54:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915930099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:01,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126662567] [2025-04-29 10:54:01,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:01,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:01,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:54:01,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 10:54:01,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:54:01,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:01,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:01,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 10:54:01,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:54:01,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:54:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126662567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:01,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2025-04-29 10:54:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946721573] [2025-04-29 10:54:01,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:01,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 10:54:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:01,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 10:54:01,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:54:01,816 INFO L87 Difference]: Start difference. First operand 163 states and 216 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:54:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:01,975 INFO L93 Difference]: Finished difference Result 239 states and 313 transitions. [2025-04-29 10:54:01,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:54:01,975 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-04-29 10:54:01,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:01,977 INFO L225 Difference]: With dead ends: 239 [2025-04-29 10:54:01,977 INFO L226 Difference]: Without dead ends: 174 [2025-04-29 10:54:01,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:54:01,978 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:01,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 369 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:54:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-29 10:54:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2025-04-29 10:54:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 146 states have internal predecessors, (174), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-29 10:54:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2025-04-29 10:54:01,995 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 45 [2025-04-29 10:54:01,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:01,995 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2025-04-29 10:54:01,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:54:01,996 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2025-04-29 10:54:01,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 10:54:01,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:01,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:02,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:02,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:02,197 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:02,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1993064225, now seen corresponding path program 2 times [2025-04-29 10:54:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:02,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503411469] [2025-04-29 10:54:02,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:02,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 10:54:02,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:54:02,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:02,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:02,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503411469] [2025-04-29 10:54:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503411469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:02,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967145091] [2025-04-29 10:54:02,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:02,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:02,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:02,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:02,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 10:54:02,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 10:54:02,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:54:02,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:02,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 10:54:02,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:02,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967145091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:02,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-04-29 10:54:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387887968] [2025-04-29 10:54:02,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:02,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 10:54:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:02,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 10:54:02,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:54:02,860 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 19 states have internal predecessors, (77), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 10:54:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:03,313 INFO L93 Difference]: Finished difference Result 330 states and 447 transitions. [2025-04-29 10:54:03,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 10:54:03,314 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 19 states have internal predecessors, (77), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-04-29 10:54:03,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:03,315 INFO L225 Difference]: With dead ends: 330 [2025-04-29 10:54:03,315 INFO L226 Difference]: Without dead ends: 250 [2025-04-29 10:54:03,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 10:54:03,317 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 116 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:03,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 601 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:54:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-29 10:54:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 189. [2025-04-29 10:54:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.2530120481927711) internal successors, (208), 172 states have internal predecessors, (208), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (30), 12 states have call predecessors, (30), 13 states have call successors, (30) [2025-04-29 10:54:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 251 transitions. [2025-04-29 10:54:03,335 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 251 transitions. Word has length 45 [2025-04-29 10:54:03,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:03,335 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 251 transitions. [2025-04-29 10:54:03,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 19 states have internal predecessors, (77), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 10:54:03,335 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 251 transitions. [2025-04-29 10:54:03,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 10:54:03,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:03,336 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:03,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:03,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-29 10:54:03,537 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:03,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2021804015, now seen corresponding path program 5 times [2025-04-29 10:54:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:03,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881881657] [2025-04-29 10:54:03,537 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:54:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:03,543 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-04-29 10:54:03,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 10:54:03,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 10:54:03,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:54:03,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:03,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881881657] [2025-04-29 10:54:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881881657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:03,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717070264] [2025-04-29 10:54:03,740 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:54:03,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:03,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:03,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:03,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 10:54:03,788 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-04-29 10:54:03,812 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 10:54:03,812 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 10:54:03,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:03,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 10:54:03,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:54:03,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:54:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717070264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:03,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:03,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 14 [2025-04-29 10:54:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812045071] [2025-04-29 10:54:03,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:03,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:54:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:54:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:54:03,968 INFO L87 Difference]: Start difference. First operand 189 states and 251 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 10:54:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:04,109 INFO L93 Difference]: Finished difference Result 296 states and 394 transitions. [2025-04-29 10:54:04,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:54:04,110 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-04-29 10:54:04,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:04,111 INFO L225 Difference]: With dead ends: 296 [2025-04-29 10:54:04,111 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 10:54:04,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:54:04,112 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:04,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 369 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:54:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 10:54:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2025-04-29 10:54:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.2448979591836735) internal successors, (183), 151 states have internal predecessors, (183), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2025-04-29 10:54:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2025-04-29 10:54:04,122 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 47 [2025-04-29 10:54:04,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:04,122 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2025-04-29 10:54:04,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 10:54:04,122 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2025-04-29 10:54:04,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 10:54:04,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:04,123 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:04,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:04,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 10:54:04,327 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:04,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1711310249, now seen corresponding path program 3 times [2025-04-29 10:54:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:04,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447773515] [2025-04-29 10:54:04,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:54:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:04,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-04-29 10:54:04,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:54:04,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 10:54:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:04,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447773515] [2025-04-29 10:54:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447773515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:04,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489518692] [2025-04-29 10:54:04,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:54:04,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:04,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:04,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 10:54:04,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-04-29 10:54:04,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 10:54:04,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 10:54:04,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:04,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-29 10:54:04,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:04,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:54:04,789 INFO L325 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-04-29 10:54:04,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-04-29 10:54:04,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:05,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2025-04-29 10:54:05,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 10:54:05,122 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2025-04-29 10:54:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:54:05,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:05,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-29 10:54:05,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-29 10:54:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489518692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:05,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 24 [2025-04-29 10:54:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480465152] [2025-04-29 10:54:05,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:05,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 10:54:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:05,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 10:54:05,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-04-29 10:54:05,272 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:54:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:05,681 INFO L93 Difference]: Finished difference Result 187 states and 236 transitions. [2025-04-29 10:54:05,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:54:05,681 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2025-04-29 10:54:05,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:05,682 INFO L225 Difference]: With dead ends: 187 [2025-04-29 10:54:05,682 INFO L226 Difference]: Without dead ends: 183 [2025-04-29 10:54:05,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-29 10:54:05,683 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 48 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:05,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 803 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:54:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-29 10:54:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2025-04-29 10:54:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 152 states have internal predecessors, (184), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2025-04-29 10:54:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2025-04-29 10:54:05,694 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 50 [2025-04-29 10:54:05,694 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:05,694 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2025-04-29 10:54:05,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:54:05,694 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2025-04-29 10:54:05,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 10:54:05,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:05,695 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:05,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 10:54:05,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 10:54:05,895 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:05,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1512919926, now seen corresponding path program 4 times [2025-04-29 10:54:05,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:05,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644960833] [2025-04-29 10:54:05,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:54:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:05,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-29 10:54:05,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 10:54:05,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:54:05,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:54:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:06,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644960833] [2025-04-29 10:54:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644960833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:06,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166169364] [2025-04-29 10:54:06,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:54:06,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:06,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:06,178 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:06,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 10:54:06,230 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-04-29 10:54:06,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 10:54:06,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:54:06,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:06,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-29 10:54:06,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:54:06,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 10:54:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166169364] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:06,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 31 [2025-04-29 10:54:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562745347] [2025-04-29 10:54:06,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:06,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 10:54:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:06,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 10:54:06,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2025-04-29 10:54:06,718 INFO L87 Difference]: Start difference. First operand 167 states and 215 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 28 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:54:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:07,324 INFO L93 Difference]: Finished difference Result 300 states and 409 transitions. [2025-04-29 10:54:07,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:54:07,325 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 28 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2025-04-29 10:54:07,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:07,327 INFO L225 Difference]: With dead ends: 300 [2025-04-29 10:54:07,327 INFO L226 Difference]: Without dead ends: 296 [2025-04-29 10:54:07,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 10:54:07,328 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 137 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:07,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1516 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 10:54:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-29 10:54:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2025-04-29 10:54:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 201 states have internal predecessors, (241), 14 states have call successors, (14), 4 states have call predecessors, (14), 9 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2025-04-29 10:54:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2025-04-29 10:54:07,351 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 51 [2025-04-29 10:54:07,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:07,351 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2025-04-29 10:54:07,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 28 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:54:07,352 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2025-04-29 10:54:07,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 10:54:07,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:07,352 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:07,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:07,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 10:54:07,553 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:07,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash 342212791, now seen corresponding path program 5 times [2025-04-29 10:54:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:07,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433110921] [2025-04-29 10:54:07,553 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:54:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:07,560 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 5 equivalence classes. [2025-04-29 10:54:07,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 10:54:07,574 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 10:54:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:08,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433110921] [2025-04-29 10:54:08,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433110921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:08,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758479296] [2025-04-29 10:54:08,271 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:54:08,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:08,273 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 10:54:08,323 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 5 equivalence classes. [2025-04-29 10:54:08,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 10:54:08,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 10:54:08,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:08,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-29 10:54:08,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:08,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:54:08,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:08,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:08,410 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:54:08,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:54:08,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-29 10:54:08,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 10:54:08,536 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 10:54:08,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 10:54:08,604 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-29 10:54:08,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2025-04-29 10:54:08,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2025-04-29 10:54:09,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2025-04-29 10:54:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:54:09,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:09,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 100 [2025-04-29 10:54:09,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 68 [2025-04-29 10:54:47,213 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:47,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2330 treesize of output 2082 [2025-04-29 10:54:47,352 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:47,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2214 treesize of output 2086 [2025-04-29 10:54:47,362 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:54:48,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758479296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:48,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:48,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 38 [2025-04-29 10:54:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598421679] [2025-04-29 10:54:48,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:48,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 10:54:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:48,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 10:54:48,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1298, Unknown=8, NotChecked=0, Total=1406 [2025-04-29 10:54:48,125 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 38 states, 38 states have (on average 2.289473684210526) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:54:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:49,095 INFO L93 Difference]: Finished difference Result 295 states and 370 transitions. [2025-04-29 10:54:49,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 10:54:49,098 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.289473684210526) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2025-04-29 10:54:49,098 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:49,100 INFO L225 Difference]: With dead ends: 295 [2025-04-29 10:54:49,100 INFO L226 Difference]: Without dead ends: 286 [2025-04-29 10:54:49,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=143, Invalid=1655, Unknown=8, NotChecked=0, Total=1806 [2025-04-29 10:54:49,101 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 63 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:49,102 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1581 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:54:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-04-29 10:54:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2025-04-29 10:54:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 232 states have (on average 1.2241379310344827) internal successors, (284), 239 states have internal predecessors, (284), 18 states have call successors, (18), 5 states have call predecessors, (18), 11 states have return successors, (32), 17 states have call predecessors, (32), 18 states have call successors, (32) [2025-04-29 10:54:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 334 transitions. [2025-04-29 10:54:49,118 INFO L79 Accepts]: Start accepts. Automaton has 262 states and 334 transitions. Word has length 52 [2025-04-29 10:54:49,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:49,118 INFO L485 AbstractCegarLoop]: Abstraction has 262 states and 334 transitions. [2025-04-29 10:54:49,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.289473684210526) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:54:49,120 INFO L278 IsEmpty]: Start isEmpty. Operand 262 states and 334 transitions. [2025-04-29 10:54:49,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 10:54:49,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:49,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:49,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 10:54:49,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 10:54:49,323 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:49,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash -281625469, now seen corresponding path program 6 times [2025-04-29 10:54:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:49,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178662725] [2025-04-29 10:54:49,323 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:54:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:49,330 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 5 equivalence classes. [2025-04-29 10:54:49,345 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 10:54:49,345 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 10:54:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:54:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:49,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178662725] [2025-04-29 10:54:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178662725] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:49,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227190552] [2025-04-29 10:54:49,537 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:54:49,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:49,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:49,539 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:49,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 10:54:49,599 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 5 equivalence classes. [2025-04-29 10:54:49,622 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 10:54:49,622 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 10:54:49,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:49,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 10:54:49,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:54:49,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:54:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227190552] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:49,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 20 [2025-04-29 10:54:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190842742] [2025-04-29 10:54:49,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:49,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 10:54:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:49,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 10:54:49,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:54:49,908 INFO L87 Difference]: Start difference. First operand 262 states and 334 transitions. Second operand has 20 states, 20 states have (on average 3.95) internal successors, (79), 19 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:54:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:50,165 INFO L93 Difference]: Finished difference Result 352 states and 457 transitions. [2025-04-29 10:54:50,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 10:54:50,166 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 19 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-04-29 10:54:50,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:50,168 INFO L225 Difference]: With dead ends: 352 [2025-04-29 10:54:50,168 INFO L226 Difference]: Without dead ends: 290 [2025-04-29 10:54:50,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:54:50,169 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:50,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 581 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:54:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-04-29 10:54:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 253. [2025-04-29 10:54:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 224 states have (on average 1.2232142857142858) internal successors, (274), 231 states have internal predecessors, (274), 17 states have call successors, (17), 5 states have call predecessors, (17), 11 states have return successors, (30), 16 states have call predecessors, (30), 17 states have call successors, (30) [2025-04-29 10:54:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 321 transitions. [2025-04-29 10:54:50,185 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 321 transitions. Word has length 55 [2025-04-29 10:54:50,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:50,185 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 321 transitions. [2025-04-29 10:54:50,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 19 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:54:50,185 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 321 transitions. [2025-04-29 10:54:50,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 10:54:50,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:50,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:50,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 10:54:50,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 10:54:50,387 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:50,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash -813979839, now seen corresponding path program 1 times [2025-04-29 10:54:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:50,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077048413] [2025-04-29 10:54:50,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:50,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 10:54:50,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 10:54:50,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:50,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 10:54:50,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:50,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077048413] [2025-04-29 10:54:50,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077048413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:50,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139506918] [2025-04-29 10:54:50,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:50,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:50,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:50,471 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:50,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 10:54:50,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 10:54:50,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 10:54:50,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:50,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:50,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:54:50,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:54:50,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:54:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139506918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:50,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:54:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-04-29 10:54:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231630380] [2025-04-29 10:54:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:50,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:54:50,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:50,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:54:50,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:54:50,617 INFO L87 Difference]: Start difference. First operand 253 states and 321 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Killed by 15