./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:19:26,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:19:26,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:19:26,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:19:26,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:19:26,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:19:26,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:19:26,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:19:26,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:19:26,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:19:26,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:19:26,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:19:26,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:19:26,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:19:26,778 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:19:26,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:19:26,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:19:26,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:19:26,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:19:26,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:19:26,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:19:26,780 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 ! overflow) ) 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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2025-04-30 10:19:27,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:19:27,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:19:27,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:19:27,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:19:27,049 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:19:27,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1-1.i [2025-04-30 10:19:28,360 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f428bb2a3/e210bdaf3b044e54896f327ee884e99d/FLAG3e0d47367 [2025-04-30 10:19:28,631 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:19:28,632 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/test-0232_1-1.i [2025-04-30 10:19:28,645 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f428bb2a3/e210bdaf3b044e54896f327ee884e99d/FLAG3e0d47367 [2025-04-30 10:19:29,411 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f428bb2a3/e210bdaf3b044e54896f327ee884e99d [2025-04-30 10:19:29,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:19:29,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:19:29,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:19:29,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:19:29,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:19:29,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659bef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29, skipping insertion in model container [2025-04-30 10:19:29,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:19:29,669 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:19:29,675 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:19:29,727 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:19:29,753 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:19:29,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29 WrapperNode [2025-04-30 10:19:29,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:19:29,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:19:29,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:19:29,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:19:29,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,784 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-04-30 10:19:29,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:19:29,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:19:29,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:19:29,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:19:29,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,814 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2025-04-30 10:19:29,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:19:29,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:19:29,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:19:29,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:19:29,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (1/1) ... [2025-04-30 10:19:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:19:29,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:29,866 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-30 10:19:29,869 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-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:19:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:19:29,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:19:29,968 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:19:29,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:19:30,083 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-04-30 10:19:30,083 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:19:30,092 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:19:30,092 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:19:30,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:19:30 BoogieIcfgContainer [2025-04-30 10:19:30,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:19:30,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:19:30,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:19:30,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:19:30,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:19:29" (1/3) ... [2025-04-30 10:19:30,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3406f631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:19:30, skipping insertion in model container [2025-04-30 10:19:30,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:19:29" (2/3) ... [2025-04-30 10:19:30,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3406f631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:19:30, skipping insertion in model container [2025-04-30 10:19:30,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:19:30" (3/3) ... [2025-04-30 10:19:30,098 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2025-04-30 10:19:30,107 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:19:30,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232_1-1.i that has 1 procedures, 30 locations, 35 edges, 1 initial locations, 2 loop locations, and 8 error locations. [2025-04-30 10:19:30,146 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:19:30,155 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;@70bf8661, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:19:30,156 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-30 10:19:30,158 INFO L278 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:19:30,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:30,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:19:30,162 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:30,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:30,166 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-04-30 10:19:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:30,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113865966] [2025-04-30 10:19:30,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:30,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:19:30,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:19:30,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:30,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113865966] [2025-04-30 10:19:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113865966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:19:30,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830271245] [2025-04-30 10:19:30,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:30,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:19:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:30,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:19:30,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:30,341 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:30,383 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-04-30 10:19:30,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:19:30,385 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-30 10:19:30,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:30,391 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:19:30,391 INFO L226 Difference]: Without dead ends: 26 [2025-04-30 10:19:30,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:19:30,396 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:30,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-30 10:19:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-30 10:19:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-30 10:19:30,421 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 4 [2025-04-30 10:19:30,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:30,421 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-30 10:19:30,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,421 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-30 10:19:30,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:19:30,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:30,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:19:30,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:19:30,422 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:30,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-04-30 10:19:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:30,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926538179] [2025-04-30 10:19:30,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:30,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:19:30,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:19:30,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:30,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:30,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926538179] [2025-04-30 10:19:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926538179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:19:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529866082] [2025-04-30 10:19:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:30,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:19:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:30,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:19:30,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:30,478 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:30,499 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-04-30 10:19:30,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:19:30,500 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:19:30,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:30,500 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:19:30,500 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:19:30,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:19:30,500 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:30,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:19:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:19:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-04-30 10:19:30,504 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 5 [2025-04-30 10:19:30,504 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:30,504 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-04-30 10:19:30,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,504 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-04-30 10:19:30,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:19:30,505 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:30,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:30,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:19:30,505 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:30,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 262867306, now seen corresponding path program 1 times [2025-04-30 10:19:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:30,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532849195] [2025-04-30 10:19:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:30,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:19:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:19:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:30,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:30,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532849195] [2025-04-30 10:19:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532849195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:30,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:30,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:19:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350379185] [2025-04-30 10:19:30,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:30,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:19:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:30,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:19:30,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:19:30,818 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:30,893 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2025-04-30 10:19:30,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:19:30,895 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:19:30,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:30,895 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:19:30,895 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:19:30,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:19:30,896 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:30,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 95 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:19:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-04-30 10:19:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-04-30 10:19:30,900 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2025-04-30 10:19:30,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:30,901 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-04-30 10:19:30,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:30,901 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-04-30 10:19:30,901 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:19:30,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:30,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:30,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:19:30,901 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:30,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 262926888, now seen corresponding path program 1 times [2025-04-30 10:19:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:30,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663440635] [2025-04-30 10:19:30,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:19:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:19:30,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:30,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:30,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663440635] [2025-04-30 10:19:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663440635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:30,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:19:30,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128933392] [2025-04-30 10:19:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:30,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:19:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:30,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:19:30,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:30,980 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,009 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-04-30 10:19:31,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:19:31,010 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:19:31,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,010 INFO L225 Difference]: With dead ends: 36 [2025-04-30 10:19:31,010 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:19:31,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:31,011 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:19:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-30 10:19:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-04-30 10:19:31,017 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2025-04-30 10:19:31,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,018 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-04-30 10:19:31,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,018 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-04-30 10:19:31,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:19:31,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:19:31,018 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1061291323, now seen corresponding path program 1 times [2025-04-30 10:19:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620650298] [2025-04-30 10:19:31,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:19:31,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:19:31,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620650298] [2025-04-30 10:19:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620650298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:31,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:19:31,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756156896] [2025-04-30 10:19:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:19:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:19:31,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:31,065 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,079 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-04-30 10:19:31,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:19:31,080 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:19:31,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,080 INFO L225 Difference]: With dead ends: 34 [2025-04-30 10:19:31,080 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:19:31,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:19:31,081 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:19:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-30 10:19:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-04-30 10:19:31,083 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2025-04-30 10:19:31,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,084 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-04-30 10:19:31,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,084 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-04-30 10:19:31,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:19:31,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:19:31,085 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1061392675, now seen corresponding path program 1 times [2025-04-30 10:19:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358987666] [2025-04-30 10:19:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:19:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:19:31,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358987666] [2025-04-30 10:19:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358987666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:19:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342924028] [2025-04-30 10:19:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:19:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:19:31,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:19:31,176 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,216 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-04-30 10:19:31,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:19:31,216 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:19:31,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,217 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:19:31,217 INFO L226 Difference]: Without dead ends: 41 [2025-04-30 10:19:31,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:19:31,217 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-30 10:19:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-04-30 10:19:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-04-30 10:19:31,221 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2025-04-30 10:19:31,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,221 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-04-30 10:19:31,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,221 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-04-30 10:19:31,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:19:31,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:19:31,222 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1456964556, now seen corresponding path program 1 times [2025-04-30 10:19:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722837259] [2025-04-30 10:19:31,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:19:31,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:19:31,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:31,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722837259] [2025-04-30 10:19:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722837259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:19:31,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145956225] [2025-04-30 10:19:31,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:19:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:19:31,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:31,269 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,288 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-04-30 10:19:31,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:19:31,289 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:19:31,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,289 INFO L225 Difference]: With dead ends: 35 [2025-04-30 10:19:31,289 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:19:31,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:31,290 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:19:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-30 10:19:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-04-30 10:19:31,292 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2025-04-30 10:19:31,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,292 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-04-30 10:19:31,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,292 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-04-30 10:19:31,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:19:31,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:19:31,296 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2078739096, now seen corresponding path program 1 times [2025-04-30 10:19:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782696125] [2025-04-30 10:19:31,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:19:31,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:19:31,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782696125] [2025-04-30 10:19:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782696125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:31,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:19:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654778434] [2025-04-30 10:19:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:19:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:19:31,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:19:31,390 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,430 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-04-30 10:19:31,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:19:31,432 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:19:31,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,433 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:19:31,433 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:19:31,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:19:31,433 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:19:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2025-04-30 10:19:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-04-30 10:19:31,436 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2025-04-30 10:19:31,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,437 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-04-30 10:19:31,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,437 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-04-30 10:19:31,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:19:31,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:19:31,437 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 403386945, now seen corresponding path program 1 times [2025-04-30 10:19:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501243988] [2025-04-30 10:19:31,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:19:31,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:19:31,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501243988] [2025-04-30 10:19:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501243988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:31,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274014826] [2025-04-30 10:19:31,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:31,528 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-30 10:19:31,540 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-30 10:19:31,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:19:31,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:19:31,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:19:31,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:31,673 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-30 10:19:31,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:19:31,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274014826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:19:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:19:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609230230] [2025-04-30 10:19:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:19:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:19:31,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:19:31,675 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,702 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-04-30 10:19:31,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:19:31,703 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:19:31,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,703 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:19:31,703 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:19:31,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:19:31,704 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:19:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:19:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-04-30 10:19:31,707 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2025-04-30 10:19:31,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,707 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-04-30 10:19:31,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,707 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-04-30 10:19:31,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:19:31,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,714 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-30 10:19:31,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:31,908 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash 508481242, now seen corresponding path program 1 times [2025-04-30 10:19:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550974297] [2025-04-30 10:19:31,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:19:31,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:19:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550974297] [2025-04-30 10:19:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550974297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:19:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796256183] [2025-04-30 10:19:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:19:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:19:31,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:19:31,950 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:31,956 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-04-30 10:19:31,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:19:31,957 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:19:31,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:31,957 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:19:31,957 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:19:31,957 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:19:31,958 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:31,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:19:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-30 10:19:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-04-30 10:19:31,960 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2025-04-30 10:19:31,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:31,960 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-04-30 10:19:31,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:31,961 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-04-30 10:19:31,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:19:31,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:31,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:31,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:19:31,961 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:31,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -379906540, now seen corresponding path program 1 times [2025-04-30 10:19:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290044659] [2025-04-30 10:19:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:19:31,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:19:31,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:31,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:32,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:32,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290044659] [2025-04-30 10:19:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290044659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:32,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938054682] [2025-04-30 10:19:32,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:32,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:32,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:32,046 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-30 10:19:32,048 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-30 10:19:32,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:19:32,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:19:32,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:32,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:32,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:19:32,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:32,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938054682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:32,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:32,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-30 10:19:32,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010980413] [2025-04-30 10:19:32,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:32,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:19:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:32,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:19:32,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:19:32,263 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:32,306 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-04-30 10:19:32,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:19:32,307 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:19:32,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:32,307 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:19:32,307 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:19:32,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:19:32,308 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:32,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:19:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2025-04-30 10:19:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-04-30 10:19:32,312 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 19 [2025-04-30 10:19:32,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:32,312 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-04-30 10:19:32,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:32,312 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-04-30 10:19:32,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:19:32,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:32,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:32,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:19:32,517 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,SelfDestructingSolverStorable10 [2025-04-30 10:19:32,517 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:32,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1416950596, now seen corresponding path program 1 times [2025-04-30 10:19:32,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:32,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831442130] [2025-04-30 10:19:32,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:32,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:19:32,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:19:32,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:32,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:32,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831442130] [2025-04-30 10:19:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831442130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919326399] [2025-04-30 10:19:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:32,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:19:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:32,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:19:32,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:19:32,600 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:32,637 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-04-30 10:19:32,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:19:32,637 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:19:32,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:32,637 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:19:32,637 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:19:32,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:19:32,638 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:32,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:19:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-30 10:19:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-04-30 10:19:32,642 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 19 [2025-04-30 10:19:32,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:32,642 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-04-30 10:19:32,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:32,642 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-04-30 10:19:32,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:19:32,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:32,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:32,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:19:32,643 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:32,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1965216673, now seen corresponding path program 1 times [2025-04-30 10:19:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:32,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470265271] [2025-04-30 10:19:32,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:32,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:19:32,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:19:32,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:32,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:32,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:32,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470265271] [2025-04-30 10:19:32,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470265271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:32,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831751710] [2025-04-30 10:19:32,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:32,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:32,775 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-30 10:19:32,777 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-30 10:19:32,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:19:32,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:19:32,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:32,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:32,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:19:32,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:32,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831751710] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:33,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:33,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-30 10:19:33,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126157483] [2025-04-30 10:19:33,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:33,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:19:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:33,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:19:33,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:19:33,030 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:33,096 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-04-30 10:19:33,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:19:33,096 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-30 10:19:33,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:33,097 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:19:33,098 INFO L226 Difference]: Without dead ends: 62 [2025-04-30 10:19:33,098 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:19:33,099 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:33,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 106 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:19:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-30 10:19:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2025-04-30 10:19:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-04-30 10:19:33,108 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 25 [2025-04-30 10:19:33,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:33,108 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-04-30 10:19:33,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:33,109 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-04-30 10:19:33,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:19:33,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:33,109 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] [2025-04-30 10:19:33,117 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-30 10:19:33,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:33,310 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:33,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1070612075, now seen corresponding path program 1 times [2025-04-30 10:19:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:33,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945672925] [2025-04-30 10:19:33,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:33,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:19:33,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:19:33,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:33,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:33,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945672925] [2025-04-30 10:19:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945672925] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:33,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046222812] [2025-04-30 10:19:33,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:33,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:33,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:33,437 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-30 10:19:33,439 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-30 10:19:33,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:19:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:19:33,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:33,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:19:33,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:33,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046222812] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:33,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:33,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:19:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58282254] [2025-04-30 10:19:33,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:33,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:19:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:33,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:19:33,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:19:33,729 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:33,803 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-04-30 10:19:33,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:19:33,803 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:19:33,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:33,804 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:19:33,804 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:19:33,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:19:33,804 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:33,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:19:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:19:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-04-30 10:19:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-04-30 10:19:33,811 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2025-04-30 10:19:33,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:33,811 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-04-30 10:19:33,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:33,811 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-04-30 10:19:33,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:19:33,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:33,812 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-04-30 10:19:33,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:19:34,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:34,012 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:34,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1836255949, now seen corresponding path program 2 times [2025-04-30 10:19:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:34,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423697495] [2025-04-30 10:19:34,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:34,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:19:34,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:19:34,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:19:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:34,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423697495] [2025-04-30 10:19:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423697495] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:34,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285152116] [2025-04-30 10:19:34,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:34,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:34,267 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-30 10:19:34,268 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-30 10:19:34,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:19:34,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:19:34,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:19:34,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:34,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:19:34,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:34,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285152116] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:34,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-30 10:19:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979004726] [2025-04-30 10:19:34,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:34,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:19:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:19:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:19:34,642 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:34,681 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-04-30 10:19:34,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:19:34,681 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-30 10:19:34,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:34,682 INFO L225 Difference]: With dead ends: 102 [2025-04-30 10:19:34,682 INFO L226 Difference]: Without dead ends: 101 [2025-04-30 10:19:34,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:19:34,683 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:34,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:19:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-30 10:19:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-30 10:19:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-04-30 10:19:34,686 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 46 [2025-04-30 10:19:34,687 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:34,687 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-04-30 10:19:34,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:34,687 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-04-30 10:19:34,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-04-30 10:19:34,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:34,688 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-04-30 10:19:34,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:19:34,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:19:34,889 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:34,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1055163795, now seen corresponding path program 3 times [2025-04-30 10:19:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:34,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084748911] [2025-04-30 10:19:34,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:34,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-04-30 10:19:35,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:19:35,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:19:35,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:35,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:35,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084748911] [2025-04-30 10:19:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084748911] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:35,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162024481] [2025-04-30 10:19:35,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:35,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:35,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:35,749 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-30 10:19:35,750 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-30 10:19:35,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-04-30 10:19:54,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:19:54,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:19:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:54,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:19:54,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:54,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:54,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162024481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:54,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:54,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-04-30 10:19:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750390020] [2025-04-30 10:19:54,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:54,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-30 10:19:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:54,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-30 10:19:54,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:19:54,777 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 48 states, 47 states have (on average 4.425531914893617) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:19:54,873 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2025-04-30 10:19:54,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-30 10:19:54,874 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.425531914893617) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-04-30 10:19:54,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:19:54,875 INFO L225 Difference]: With dead ends: 210 [2025-04-30 10:19:54,875 INFO L226 Difference]: Without dead ends: 209 [2025-04-30 10:19:54,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:19:54,877 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:19:54,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 191 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:19:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-30 10:19:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-04-30 10:19:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.1105769230769231) internal successors, (231), 208 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2025-04-30 10:19:54,888 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 100 [2025-04-30 10:19:54,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:19:54,888 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2025-04-30 10:19:54,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.425531914893617) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:54,889 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2025-04-30 10:19:54,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-04-30 10:19:54,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:19:54,892 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-04-30 10:19:54,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:19:55,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:19:55,093 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-30 10:19:55,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1494905261, now seen corresponding path program 4 times [2025-04-30 10:19:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:55,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021037695] [2025-04-30 10:19:55,095 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:55,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. [2025-04-30 10:19:55,268 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-04-30 10:19:55,269 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:55,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 0 proven. 2255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:57,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021037695] [2025-04-30 10:19:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021037695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:57,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563893648] [2025-04-30 10:19:57,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:57,946 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-30 10:19:57,948 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-30 10:19:58,236 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. Killed by 15