./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.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 b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:35:03,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:35:03,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:35:03,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:35:03,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:35:03,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:35:03,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:35:03,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:35:03,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:35:03,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:35:03,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:35:03,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:35:03,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:35:03,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:35:03,463 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:35:03,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:35:03,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:35:03,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:35:03,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:35:03,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:35:03,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:35:03,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:35:03,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:35:03,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:35:03,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:35:03,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:35:03,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:35:03,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:35:03,466 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 -> b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a [2025-03-09 01:35:03,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:35:03,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:35:03,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:35:03,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:35:03,693 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:35:03,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2025-03-09 01:35:04,802 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af86ae54/57b2323b1525442398ddb35667df627e/FLAG795396f70 [2025-03-09 01:35:05,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:35:05,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2025-03-09 01:35:05,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af86ae54/57b2323b1525442398ddb35667df627e/FLAG795396f70 [2025-03-09 01:35:05,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af86ae54/57b2323b1525442398ddb35667df627e [2025-03-09 01:35:05,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:35:05,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:35:05,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:35:05,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:35:05,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:35:05,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5808d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05, skipping insertion in model container [2025-03-09 01:35:05,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:35:05,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:35:05,223 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:35:05,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:35:05,246 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:35:05,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05 WrapperNode [2025-03-09 01:35:05,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:35:05,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:35:05,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:35:05,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:35:05,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,273 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-03-09 01:35:05,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:35:05,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:35:05,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:35:05,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:35:05,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,294 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:35:05,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:35:05,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:35:05,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:35:05,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:35:05,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (1/1) ... [2025-03-09 01:35:05,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:35:05,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:05,341 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-03-09 01:35:05,344 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-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:35:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:35:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:35:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:35:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:35:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:35:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:35:05,426 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:35:05,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:35:05,567 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-09 01:35:05,574 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-09 01:35:05,575 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:35:05,584 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:35:05,584 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:35:05,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:35:05 BoogieIcfgContainer [2025-03-09 01:35:05,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:35:05,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:35:05,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:35:05,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:35:05,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:35:05" (1/3) ... [2025-03-09 01:35:05,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8eaa9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:35:05, skipping insertion in model container [2025-03-09 01:35:05,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:35:05" (2/3) ... [2025-03-09 01:35:05,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8eaa9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:35:05, skipping insertion in model container [2025-03-09 01:35:05,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:35:05" (3/3) ... [2025-03-09 01:35:05,593 INFO L128 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2025-03-09 01:35:05,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:35:05,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_of_struct_ptr_flag_init.i that has 1 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-09 01:35:05,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:35:05,658 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@318ad318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:35:05,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:35:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 29 states have internal predecessors, (36), 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-03-09 01:35:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:35:05,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:05,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:35:05,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2030687, now seen corresponding path program 1 times [2025-03-09 01:35:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626046683] [2025-03-09 01:35:05,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:05,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:35:05,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:35:05,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:05,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:05,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:05,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626046683] [2025-03-09 01:35:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626046683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:35:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:35:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720343323] [2025-03-09 01:35:05,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:35:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:05,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:35:05,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:35:05,889 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 29 states have internal predecessors, (36), 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), 4 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-03-09 01:35:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:05,928 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-09 01:35:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:35:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-03-09 01:35:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:05,934 INFO L225 Difference]: With dead ends: 49 [2025-03-09 01:35:05,934 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 01:35:05,936 INFO L434 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-03-09 01:35:05,938 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:05,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 01:35:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-09 01:35:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 26 states have internal predecessors, (32), 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-03-09 01:35:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-09 01:35:05,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 4 [2025-03-09 01:35:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:05,966 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-09 01:35:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-03-09 01:35:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-09 01:35:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:35:05,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:05,966 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:35:05,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:35:05,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:05,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash 366653406, now seen corresponding path program 1 times [2025-03-09 01:35:05,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:05,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208560131] [2025-03-09 01:35:05,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:05,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:05,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:35:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:35:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208560131] [2025-03-09 01:35:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208560131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128182436] [2025-03-09 01:35:06,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:06,121 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-03-09 01:35:06,123 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-03-09 01:35:06,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:35:06,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:35:06,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:06,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:06,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:35:06,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:06,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:35:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128182436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:35:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:35:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832439667] [2025-03-09 01:35:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:35:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:06,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:35:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:35:06,261 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-03-09 01:35:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:06,294 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-03-09 01:35:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:35:06,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 01:35:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:06,296 INFO L225 Difference]: With dead ends: 27 [2025-03-09 01:35:06,296 INFO L226 Difference]: Without dead ends: 26 [2025-03-09 01:35:06,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-03-09 01:35:06,297 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:06,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-09 01:35:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-09 01:35:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 25 states have internal predecessors, (31), 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-03-09 01:35:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-09 01:35:06,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 7 [2025-03-09 01:35:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:06,300 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-09 01:35:06,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-03-09 01:35:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-09 01:35:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:35:06,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:06,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 01:35:06,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:35:06,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:06,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:06,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646303, now seen corresponding path program 1 times [2025-03-09 01:35:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:06,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292571394] [2025-03-09 01:35:06,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:35:06,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:35:06,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:06,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292571394] [2025-03-09 01:35:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292571394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778443973] [2025-03-09 01:35:06,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:06,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:06,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:06,628 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-03-09 01:35:06,629 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-03-09 01:35:06,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:35:06,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:35:06,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:06,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:06,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:35:06,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:06,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778443973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:06,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:35:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830261414] [2025-03-09 01:35:06,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:06,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:35:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:06,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:35:06,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:35:06,770 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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-03-09 01:35:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:06,811 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-03-09 01:35:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:35:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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 8 [2025-03-09 01:35:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:06,813 INFO L225 Difference]: With dead ends: 36 [2025-03-09 01:35:06,813 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:35:06,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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-03-09 01:35:06,814 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 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-03-09 01:35:06,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:35:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 01:35:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-09 01:35:06,818 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 8 [2025-03-09 01:35:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:06,818 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-09 01:35:06,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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-03-09 01:35:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-09 01:35:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:35:06,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:06,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:06,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:35:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 01:35:07,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1492855209, now seen corresponding path program 1 times [2025-03-09 01:35:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324418876] [2025-03-09 01:35:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:35:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:35:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:35:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324418876] [2025-03-09 01:35:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324418876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:07,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:35:07,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:35:07,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641264395] [2025-03-09 01:35:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:35:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:07,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:35:07,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:35:07,050 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:07,084 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-09 01:35:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:35:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:35:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:07,085 INFO L225 Difference]: With dead ends: 56 [2025-03-09 01:35:07,085 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:35:07,085 INFO L434 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-03-09 01:35:07,086 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:07,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:35:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-03-09 01:35:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-09 01:35:07,093 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 8 [2025-03-09 01:35:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:07,093 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-09 01:35:07,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-09 01:35:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:35:07,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:07,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:35:07,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -596104101, now seen corresponding path program 1 times [2025-03-09 01:35:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289902355] [2025-03-09 01:35:07,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:35:07,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:35:07,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:35:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289902355] [2025-03-09 01:35:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289902355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:07,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:35:07,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:35:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143404349] [2025-03-09 01:35:07,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:35:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:07,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:35:07,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:35:07,141 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-09 01:35:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:07,153 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2025-03-09 01:35:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:35:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13 [2025-03-09 01:35:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:07,154 INFO L225 Difference]: With dead ends: 62 [2025-03-09 01:35:07,154 INFO L226 Difference]: Without dead ends: 40 [2025-03-09 01:35:07,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03-09 01:35:07,154 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:07,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-09 01:35:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-09 01:35:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-09 01:35:07,157 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 13 [2025-03-09 01:35:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:07,157 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-09 01:35:07,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-09 01:35:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-09 01:35:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:35:07,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:07,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:07,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:35:07,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:07,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1817905220, now seen corresponding path program 1 times [2025-03-09 01:35:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815330508] [2025-03-09 01:35:07,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:35:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:35:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:35:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815330508] [2025-03-09 01:35:07,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815330508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582340222] [2025-03-09 01:35:07,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:07,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:07,236 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-03-09 01:35:07,237 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-03-09 01:35:07,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:35:07,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:35:07,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:07,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:07,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:35:07,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:35:07,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:35:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582340222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:07,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:07,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:35:07,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109035886] [2025-03-09 01:35:07,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:07,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:35:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:07,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:35:07,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:35:07,352 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-03-09 01:35:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:07,379 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-09 01:35:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:35:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-03-09 01:35:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:07,380 INFO L225 Difference]: With dead ends: 62 [2025-03-09 01:35:07,380 INFO L226 Difference]: Without dead ends: 40 [2025-03-09 01:35:07,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:35:07,381 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:07,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-09 01:35:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-09 01:35:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 39 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-03-09 01:35:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-09 01:35:07,384 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 16 [2025-03-09 01:35:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:07,385 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-09 01:35:07,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-03-09 01:35:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-09 01:35:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:35:07,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:07,385 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-09 01:35:07,392 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-03-09 01:35:07,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:07,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:07,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2104887232, now seen corresponding path program 2 times [2025-03-09 01:35:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:07,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120214707] [2025-03-09 01:35:07,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:07,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:35:07,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-03-09 01:35:07,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:35:07,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:35:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120214707] [2025-03-09 01:35:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120214707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710329590] [2025-03-09 01:35:07,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:07,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:07,643 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-03-09 01:35:07,645 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-03-09 01:35:07,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:35:07,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-03-09 01:35:07,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:35:07,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:07,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:35:07,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:35:07,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:35:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710329590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:07,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:35:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118484570] [2025-03-09 01:35:07,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:07,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:35:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:35:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:35:07,763 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-03-09 01:35:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:07,779 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-09 01:35:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:35:07,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 17 [2025-03-09 01:35:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:07,780 INFO L225 Difference]: With dead ends: 40 [2025-03-09 01:35:07,780 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 01:35:07,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:35:07,780 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:07,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 01:35:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-09 01:35:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 33 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-03-09 01:35:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-09 01:35:07,783 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 17 [2025-03-09 01:35:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:07,783 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-09 01:35:07,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-03-09 01:35:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-09 01:35:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:35:07,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:07,784 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:07,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:35:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:07,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 466707292, now seen corresponding path program 2 times [2025-03-09 01:35:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051102521] [2025-03-09 01:35:07,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:07,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:35:07,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:35:07,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:35:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:35:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051102521] [2025-03-09 01:35:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051102521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557696298] [2025-03-09 01:35:08,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:08,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:08,048 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-03-09 01:35:08,050 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-03-09 01:35:08,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:35:08,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:35:08,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:35:08,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:08,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:35:08,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:35:08,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:35:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557696298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:08,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-09 01:35:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417393681] [2025-03-09 01:35:08,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:08,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:35:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:08,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:35:08,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:35:08,308 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:08,453 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2025-03-09 01:35:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:35:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-09 01:35:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:08,454 INFO L225 Difference]: With dead ends: 72 [2025-03-09 01:35:08,454 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:35:08,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:35:08,455 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:08,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:35:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:35:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-03-09 01:35:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-09 01:35:08,463 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 22 [2025-03-09 01:35:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:08,463 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-09 01:35:08,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-09 01:35:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:35:08,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:08,465 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:08,474 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-03-09 01:35:08,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:08,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1813005774, now seen corresponding path program 1 times [2025-03-09 01:35:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663836166] [2025-03-09 01:35:08,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:35:08,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:35:08,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:08,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-09 01:35:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663836166] [2025-03-09 01:35:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663836166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960010281] [2025-03-09 01:35:08,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:08,748 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-03-09 01:35:08,749 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-03-09 01:35:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:35:08,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:35:08,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:08,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:08,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:35:08,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:35:09,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:35:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960010281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:09,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 35 [2025-03-09 01:35:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267636176] [2025-03-09 01:35:09,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:09,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:35:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:09,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:35:09,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:35:09,357 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 35 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-03-09 01:35:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:09,481 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2025-03-09 01:35:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 01:35:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 35 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) Word has length 35 [2025-03-09 01:35:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:09,485 INFO L225 Difference]: With dead ends: 98 [2025-03-09 01:35:09,485 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 01:35:09,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:35:09,486 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:09,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:35:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 01:35:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2025-03-09 01:35:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 69 states have internal predecessors, (75), 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-03-09 01:35:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2025-03-09 01:35:09,494 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 35 [2025-03-09 01:35:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:09,494 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2025-03-09 01:35:09,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 35 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-03-09 01:35:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2025-03-09 01:35:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 01:35:09,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:09,497 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:09,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:35:09,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:09,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2030579110, now seen corresponding path program 1 times [2025-03-09 01:35:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609638580] [2025-03-09 01:35:09,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:09,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 01:35:09,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:35:09,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:09,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-09 01:35:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609638580] [2025-03-09 01:35:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609638580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:09,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:35:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:35:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001825620] [2025-03-09 01:35:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:09,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:35:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:09,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:35:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:35:09,813 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-03-09 01:35:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:09,834 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2025-03-09 01:35:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:35:09,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 59 [2025-03-09 01:35:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:09,835 INFO L225 Difference]: With dead ends: 71 [2025-03-09 01:35:09,835 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 01:35:09,835 INFO L434 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-03-09 01:35:09,835 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:09,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 01:35:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-09 01:35:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 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-03-09 01:35:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-03-09 01:35:09,839 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 59 [2025-03-09 01:35:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:09,839 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-03-09 01:35:09,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-03-09 01:35:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-03-09 01:35:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 01:35:09,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:09,840 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:35:09,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 772729688, now seen corresponding path program 2 times [2025-03-09 01:35:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135613250] [2025-03-09 01:35:09,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:09,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-09 01:35:09,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 64 statements. [2025-03-09 01:35:09,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:35:09,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-09 01:35:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135613250] [2025-03-09 01:35:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135613250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:09,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:35:09,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:35:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369083768] [2025-03-09 01:35:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:09,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:35:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:09,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:35:09,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:35:09,889 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-03-09 01:35:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:09,907 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-03-09 01:35:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:35:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 64 [2025-03-09 01:35:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:09,908 INFO L225 Difference]: With dead ends: 78 [2025-03-09 01:35:09,908 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 01:35:09,909 INFO L434 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-03-09 01:35:09,909 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:09,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 01:35:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 01:35:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 75 states have internal predecessors, (82), 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-03-09 01:35:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-09 01:35:09,913 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 64 [2025-03-09 01:35:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:09,913 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-09 01:35:09,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-03-09 01:35:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-09 01:35:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 01:35:09,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:09,914 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:09,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:35:09,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:09,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash 37904523, now seen corresponding path program 1 times [2025-03-09 01:35:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992766246] [2025-03-09 01:35:09,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:09,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 01:35:09,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 01:35:09,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:09,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:35:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992766246] [2025-03-09 01:35:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992766246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334495476] [2025-03-09 01:35:10,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:10,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:10,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:10,858 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-03-09 01:35:10,859 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-03-09 01:35:10,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 01:35:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 01:35:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:10,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:35:11,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:35:11,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:35:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334495476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:13,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 95 [2025-03-09 01:35:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536309452] [2025-03-09 01:35:13,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-03-09 01:35:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:13,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-03-09 01:35:13,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=6850, Unknown=0, NotChecked=0, Total=8930 [2025-03-09 01:35:13,213 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 95 states, 95 states have (on average 1.631578947368421) internal successors, (155), 95 states have internal predecessors, (155), 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-03-09 01:35:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:13,376 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2025-03-09 01:35:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-09 01:35:13,378 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.631578947368421) internal successors, (155), 95 states have internal predecessors, (155), 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 69 [2025-03-09 01:35:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:13,379 INFO L225 Difference]: With dead ends: 152 [2025-03-09 01:35:13,379 INFO L226 Difference]: Without dead ends: 124 [2025-03-09 01:35:13,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2080, Invalid=6850, Unknown=0, NotChecked=0, Total=8930 [2025-03-09 01:35:13,383 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:13,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:35:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-09 01:35:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-09 01:35:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0655737704918034) internal successors, (130), 123 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:35:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2025-03-09 01:35:13,395 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 69 [2025-03-09 01:35:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2025-03-09 01:35:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 1.631578947368421) internal successors, (155), 95 states have internal predecessors, (155), 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-03-09 01:35:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2025-03-09 01:35:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 01:35:13,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:13,399 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:13,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:35:13,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:13,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:13,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1610957707, now seen corresponding path program 2 times [2025-03-09 01:35:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:13,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76499450] [2025-03-09 01:35:13,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:13,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-09 01:35:13,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 01:35:13,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:35:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-09 01:35:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76499450] [2025-03-09 01:35:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76499450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:35:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136635432] [2025-03-09 01:35:13,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:35:13,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:35:13,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:35:13,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:35:13,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:35:13,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-09 01:35:14,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 01:35:14,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:35:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:14,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-09 01:35:14,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:35:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:35:15,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:35:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:35:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136635432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:35:18,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:35:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 65, 65] total 132 [2025-03-09 01:35:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082261247] [2025-03-09 01:35:18,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:35:18,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-09 01:35:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:18,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-09 01:35:18,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-03-09 01:35:18,126 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 132 states, 132 states have (on average 1.7045454545454546) internal successors, (225), 132 states have internal predecessors, (225), 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-03-09 01:35:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:18,434 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2025-03-09 01:35:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-09 01:35:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.7045454545454546) internal successors, (225), 132 states have internal predecessors, (225), 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 117 [2025-03-09 01:35:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:18,436 INFO L225 Difference]: With dead ends: 247 [2025-03-09 01:35:18,436 INFO L226 Difference]: Without dead ends: 219 [2025-03-09 01:35:18,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-03-09 01:35:18,439 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:18,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:35:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-09 01:35:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-09 01:35:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.0321100917431192) internal successors, (225), 218 states have internal predecessors, (225), 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-03-09 01:35:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 225 transitions. [2025-03-09 01:35:18,447 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 225 transitions. Word has length 117 [2025-03-09 01:35:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 225 transitions. [2025-03-09 01:35:18,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.7045454545454546) internal successors, (225), 132 states have internal predecessors, (225), 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-03-09 01:35:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 225 transitions. [2025-03-09 01:35:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-09 01:35:18,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:35:18,449 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:18,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:35:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 01:35:18,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:35:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:35:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 409741243, now seen corresponding path program 1 times [2025-03-09 01:35:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:35:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982100628] [2025-03-09 01:35:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:35:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:35:18,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-09 01:35:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-09 01:35:18,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:35:18,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:35:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-09 01:35:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:35:18,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982100628] [2025-03-09 01:35:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982100628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:35:18,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:35:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:35:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281157421] [2025-03-09 01:35:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:35:18,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:35:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:35:18,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:35:18,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:35:18,916 INFO L87 Difference]: Start difference. First operand 219 states and 225 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-03-09 01:35:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:35:18,931 INFO L93 Difference]: Finished difference Result 219 states and 225 transitions. [2025-03-09 01:35:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:35:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 214 [2025-03-09 01:35:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:35:18,932 INFO L225 Difference]: With dead ends: 219 [2025-03-09 01:35:18,932 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:35:18,932 INFO L434 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-03-09 01:35:18,933 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:35:18,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:35:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:35:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:35:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03-09 01:35:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:35:18,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2025-03-09 01:35:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:35:18,934 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:35:18,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-03-09 01:35:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:35:18,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:35:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 01:35:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 01:35:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 01:35:18,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 01:35:18,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 01:35:18,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 01:35:18,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:35:18,940 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:35:18,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:35:19,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:35:19,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:35:19 BoogieIcfgContainer [2025-03-09 01:35:19,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:35:19,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:35:19,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:35:19,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:35:19,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:35:05" (3/4) ... [2025-03-09 01:35:19,326 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:35:19,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 01:35:19,334 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 01:35:19,334 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:35:19,334 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:35:19,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:35:19,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:35:19,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:35:19,393 INFO L158 Benchmark]: Toolchain (without parser) took 14323.72ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 112.5MB in the beginning and 212.1MB in the end (delta: -99.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-03-09 01:35:19,393 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:35:19,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.34ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 101.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:35:19,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.53ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.1MB in the end (delta: 933.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:35:19,394 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:35:19,395 INFO L158 Benchmark]: IcfgBuilder took 272.98ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.7MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:35:19,395 INFO L158 Benchmark]: TraceAbstraction took 13736.63ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 85.2MB in the beginning and 217.5MB in the end (delta: -132.3MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2025-03-09 01:35:19,395 INFO L158 Benchmark]: Witness Printer took 68.63ms. Allocated memory is still 251.7MB. Free memory was 217.5MB in the beginning and 212.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:35:19,396 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.34ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 101.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.53ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.1MB in the end (delta: 933.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 272.98ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.7MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13736.63ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 85.2MB in the beginning and 217.5MB in the end (delta: -132.3MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 68.63ms. Allocated memory is still 251.7MB. Free memory was 217.5MB in the beginning and 212.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 36 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 14, TraceHistogramMax: 63, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 1293 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1012 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 281 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7598 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=13, InterpolantAutomatonStates: 297, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 944 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1199 ConstructedInterpolants, 0 QuantifiedInterpolants, 3485 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2326 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 8270/12323 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((size == 100000) && (1 <= i)) || ((size == 100000) && (i == 0))) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:35:19,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE