./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:37:37,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:37:37,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:37:37,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:37:37,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:37:37,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:37:37,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:37:37,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:37:37,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:37:37,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:37:37,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:37:37,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:37:37,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:37:37,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:37:37,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:37:37,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:37:37,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:37:37,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:37:37,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:37:37,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:37:37,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:37:37,853 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-jdk21/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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2025-02-06 14:37:38,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:37:38,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:37:38,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:37:38,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:37:38,082 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:37:38,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2025-02-06 14:37:39,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/925eb77c6/3df61d40a48f4a08bff6623dc111d2e8/FLAGe1556f9a7 [2025-02-06 14:37:39,453 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:37:39,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2025-02-06 14:37:39,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/925eb77c6/3df61d40a48f4a08bff6623dc111d2e8/FLAGe1556f9a7 [2025-02-06 14:37:39,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/925eb77c6/3df61d40a48f4a08bff6623dc111d2e8 [2025-02-06 14:37:39,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:37:39,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:37:39,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:37:39,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:37:39,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:37:39,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1706b74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39, skipping insertion in model container [2025-02-06 14:37:39,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:37:39,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:37:39,652 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:37:39,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:37:39,695 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:37:39,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39 WrapperNode [2025-02-06 14:37:39,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:37:39,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:37:39,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:37:39,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:37:39,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,722 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2025-02-06 14:37:39,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:37:39,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:37:39,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:37:39,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:37:39,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,752 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 14:37:39,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:37:39,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:37:39,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:37:39,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:37:39,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (1/1) ... [2025-02-06 14:37:39,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:37:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:39,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:37:39,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-06 14:37:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:37:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:37:39,883 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:37:39,884 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:37:40,130 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-06 14:37:40,130 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:37:40,144 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:37:40,144 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:37:40,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:40 BoogieIcfgContainer [2025-02-06 14:37:40,144 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:37:40,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:37:40,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:37:40,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:37:40,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:37:39" (1/3) ... [2025-02-06 14:37:40,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290bb65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:40, skipping insertion in model container [2025-02-06 14:37:40,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:39" (2/3) ... [2025-02-06 14:37:40,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290bb65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:40, skipping insertion in model container [2025-02-06 14:37:40,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:40" (3/3) ... [2025-02-06 14:37:40,156 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2025-02-06 14:37:40,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:37:40,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.01.cil-1.c that has 7 procedures, 118 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2025-02-06 14:37:40,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:37:40,235 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;@55aa56fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:37:40,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 14:37:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 97 states have internal predecessors, (135), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 14:37:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:37:40,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:40,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:40,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -785698940, now seen corresponding path program 1 times [2025-02-06 14:37:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377802512] [2025-02-06 14:37:40,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:40,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:37:40,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:37:40,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:40,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377802512] [2025-02-06 14:37:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377802512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:40,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620800609] [2025-02-06 14:37:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:40,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:40,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:40,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:40,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:40,589 INFO L87 Difference]: Start difference. First operand has 118 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 97 states have internal predecessors, (135), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:40,878 INFO L93 Difference]: Finished difference Result 336 states and 475 transitions. [2025-02-06 14:37:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-02-06 14:37:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:40,885 INFO L225 Difference]: With dead ends: 336 [2025-02-06 14:37:40,885 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 14:37:40,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:40,889 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 231 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:40,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 434 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 14:37:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2025-02-06 14:37:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.4337349397590362) internal successors, (238), 171 states have internal predecessors, (238), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-02-06 14:37:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2025-02-06 14:37:40,929 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 55 [2025-02-06 14:37:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:40,929 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2025-02-06 14:37:40,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2025-02-06 14:37:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:37:40,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:40,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:37:40,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 446518146, now seen corresponding path program 1 times [2025-02-06 14:37:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736377695] [2025-02-06 14:37:40,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:40,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:37:40,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:37:40,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:40,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736377695] [2025-02-06 14:37:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736377695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781096867] [2025-02-06 14:37:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:41,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:41,042 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:41,318 INFO L93 Difference]: Finished difference Result 524 states and 728 transitions. [2025-02-06 14:37:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-02-06 14:37:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:41,321 INFO L225 Difference]: With dead ends: 524 [2025-02-06 14:37:41,321 INFO L226 Difference]: Without dead ends: 325 [2025-02-06 14:37:41,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:41,322 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 214 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:41,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 734 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-06 14:37:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 300. [2025-02-06 14:37:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 241 states have (on average 1.4232365145228216) internal successors, (343), 247 states have internal predecessors, (343), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-02-06 14:37:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 417 transitions. [2025-02-06 14:37:41,363 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 417 transitions. Word has length 55 [2025-02-06 14:37:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:41,363 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 417 transitions. [2025-02-06 14:37:41,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 417 transitions. [2025-02-06 14:37:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:37:41,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:41,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:41,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:37:41,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2178493, now seen corresponding path program 1 times [2025-02-06 14:37:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096586244] [2025-02-06 14:37:41,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:41,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:37:41,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:37:41,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:41,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096586244] [2025-02-06 14:37:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096586244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772580490] [2025-02-06 14:37:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:41,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:41,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:41,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:41,471 INFO L87 Difference]: Start difference. First operand 300 states and 417 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:41,741 INFO L93 Difference]: Finished difference Result 828 states and 1152 transitions. [2025-02-06 14:37:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-02-06 14:37:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:41,745 INFO L225 Difference]: With dead ends: 828 [2025-02-06 14:37:41,745 INFO L226 Difference]: Without dead ends: 537 [2025-02-06 14:37:41,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:41,747 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 253 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:41,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 705 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-06 14:37:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 481. [2025-02-06 14:37:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 388 states have (on average 1.407216494845361) internal successors, (546), 398 states have internal predecessors, (546), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2025-02-06 14:37:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 668 transitions. [2025-02-06 14:37:41,779 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 668 transitions. Word has length 55 [2025-02-06 14:37:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 668 transitions. [2025-02-06 14:37:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 668 transitions. [2025-02-06 14:37:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:37:41,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:41,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:41,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:37:41,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:41,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:41,782 INFO L85 PathProgramCache]: Analyzing trace with hash 121894754, now seen corresponding path program 1 times [2025-02-06 14:37:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262641380] [2025-02-06 14:37:41,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:41,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:41,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:37:41,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:37:41,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:41,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:41,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262641380] [2025-02-06 14:37:41,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262641380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:41,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:41,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:41,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503782671] [2025-02-06 14:37:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:41,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:41,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:41,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:41,853 INFO L87 Difference]: Start difference. First operand 481 states and 668 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:41,977 INFO L93 Difference]: Finished difference Result 975 states and 1362 transitions. [2025-02-06 14:37:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:37:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-02-06 14:37:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:41,981 INFO L225 Difference]: With dead ends: 975 [2025-02-06 14:37:41,981 INFO L226 Difference]: Without dead ends: 503 [2025-02-06 14:37:41,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:41,982 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 170 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:41,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 265 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-06 14:37:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 481. [2025-02-06 14:37:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 388 states have (on average 1.3943298969072164) internal successors, (541), 398 states have internal predecessors, (541), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2025-02-06 14:37:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 663 transitions. [2025-02-06 14:37:42,012 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 663 transitions. Word has length 55 [2025-02-06 14:37:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 663 transitions. [2025-02-06 14:37:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 663 transitions. [2025-02-06 14:37:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:37:42,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:42,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:37:42,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1813765533, now seen corresponding path program 1 times [2025-02-06 14:37:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342799648] [2025-02-06 14:37:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:42,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:37:42,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:37:42,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:42,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342799648] [2025-02-06 14:37:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342799648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974824385] [2025-02-06 14:37:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:42,051 INFO L87 Difference]: Start difference. First operand 481 states and 663 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:42,179 INFO L93 Difference]: Finished difference Result 1385 states and 1938 transitions. [2025-02-06 14:37:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:37:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-02-06 14:37:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:42,183 INFO L225 Difference]: With dead ends: 1385 [2025-02-06 14:37:42,184 INFO L226 Difference]: Without dead ends: 914 [2025-02-06 14:37:42,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:42,186 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:42,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 477 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-02-06 14:37:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 907. [2025-02-06 14:37:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 729 states have (on average 1.3552812071330589) internal successors, (988), 750 states have internal predecessors, (988), 102 states have call successors, (102), 60 states have call predecessors, (102), 72 states have return successors, (131), 100 states have call predecessors, (131), 102 states have call successors, (131) [2025-02-06 14:37:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1221 transitions. [2025-02-06 14:37:42,262 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1221 transitions. Word has length 55 [2025-02-06 14:37:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:42,263 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1221 transitions. [2025-02-06 14:37:42,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1221 transitions. [2025-02-06 14:37:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 14:37:42,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:42,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:42,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:37:42,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:42,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash 333856037, now seen corresponding path program 1 times [2025-02-06 14:37:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:42,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542460512] [2025-02-06 14:37:42,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:42,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 14:37:42,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 14:37:42,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:42,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542460512] [2025-02-06 14:37:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542460512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584201684] [2025-02-06 14:37:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:42,339 INFO L87 Difference]: Start difference. First operand 907 states and 1221 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:42,419 INFO L93 Difference]: Finished difference Result 1819 states and 2486 transitions. [2025-02-06 14:37:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:42,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-02-06 14:37:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:42,426 INFO L225 Difference]: With dead ends: 1819 [2025-02-06 14:37:42,426 INFO L226 Difference]: Without dead ends: 922 [2025-02-06 14:37:42,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:42,430 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:42,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-02-06 14:37:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-02-06 14:37:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 744 states have (on average 1.3413978494623655) internal successors, (998), 765 states have internal predecessors, (998), 102 states have call successors, (102), 60 states have call predecessors, (102), 72 states have return successors, (131), 100 states have call predecessors, (131), 102 states have call successors, (131) [2025-02-06 14:37:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1231 transitions. [2025-02-06 14:37:42,514 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1231 transitions. Word has length 56 [2025-02-06 14:37:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:42,515 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1231 transitions. [2025-02-06 14:37:42,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1231 transitions. [2025-02-06 14:37:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 14:37:42,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:42,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:37:42,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:42,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1849820890, now seen corresponding path program 1 times [2025-02-06 14:37:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:42,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240699671] [2025-02-06 14:37:42,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:42,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 14:37:42,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 14:37:42,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240699671] [2025-02-06 14:37:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240699671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820867438] [2025-02-06 14:37:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:42,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:42,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:42,565 INFO L87 Difference]: Start difference. First operand 922 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:42,748 INFO L93 Difference]: Finished difference Result 2699 states and 3619 transitions. [2025-02-06 14:37:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:37:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-02-06 14:37:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:42,755 INFO L225 Difference]: With dead ends: 2699 [2025-02-06 14:37:42,756 INFO L226 Difference]: Without dead ends: 1787 [2025-02-06 14:37:42,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:42,758 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 255 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:42,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 473 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2025-02-06 14:37:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1755. [2025-02-06 14:37:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1413 states have (on average 1.3213021939136589) internal successors, (1867), 1451 states have internal predecessors, (1867), 194 states have call successors, (194), 120 states have call predecessors, (194), 144 states have return successors, (249), 187 states have call predecessors, (249), 194 states have call successors, (249) [2025-02-06 14:37:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2310 transitions. [2025-02-06 14:37:42,852 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2310 transitions. Word has length 56 [2025-02-06 14:37:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:42,852 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2310 transitions. [2025-02-06 14:37:42,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2310 transitions. [2025-02-06 14:37:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:42,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:42,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:42,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:37:42,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1069890611, now seen corresponding path program 1 times [2025-02-06 14:37:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991340336] [2025-02-06 14:37:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:42,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:42,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:42,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:42,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:37:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:42,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991340336] [2025-02-06 14:37:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991340336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:42,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437547661] [2025-02-06 14:37:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:42,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:42,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:42,898 INFO L87 Difference]: Start difference. First operand 1755 states and 2310 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:43,003 INFO L93 Difference]: Finished difference Result 3530 states and 4716 transitions. [2025-02-06 14:37:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 14:37:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:43,010 INFO L225 Difference]: With dead ends: 3530 [2025-02-06 14:37:43,011 INFO L226 Difference]: Without dead ends: 1785 [2025-02-06 14:37:43,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:43,013 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:43,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-02-06 14:37:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2025-02-06 14:37:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1443 states have (on average 1.3076923076923077) internal successors, (1887), 1481 states have internal predecessors, (1887), 194 states have call successors, (194), 120 states have call predecessors, (194), 144 states have return successors, (249), 187 states have call predecessors, (249), 194 states have call successors, (249) [2025-02-06 14:37:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2330 transitions. [2025-02-06 14:37:43,090 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2330 transitions. Word has length 74 [2025-02-06 14:37:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:43,090 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2330 transitions. [2025-02-06 14:37:43,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2330 transitions. [2025-02-06 14:37:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:43,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:43,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:37:43,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -630849868, now seen corresponding path program 1 times [2025-02-06 14:37:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244435291] [2025-02-06 14:37:43,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:43,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:43,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:43,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:43,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:37:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244435291] [2025-02-06 14:37:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244435291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981964267] [2025-02-06 14:37:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:43,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:43,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:43,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:43,178 INFO L87 Difference]: Start difference. First operand 1785 states and 2330 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:43,445 INFO L93 Difference]: Finished difference Result 2629 states and 3442 transitions. [2025-02-06 14:37:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:43,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 14:37:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:43,453 INFO L225 Difference]: With dead ends: 2629 [2025-02-06 14:37:43,453 INFO L226 Difference]: Without dead ends: 1519 [2025-02-06 14:37:43,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:43,458 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 207 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:43,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 481 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-02-06 14:37:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1407. [2025-02-06 14:37:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1141 states have (on average 1.2997370727432078) internal successors, (1483), 1161 states have internal predecessors, (1483), 158 states have call successors, (158), 96 states have call predecessors, (158), 104 states have return successors, (171), 151 states have call predecessors, (171), 158 states have call successors, (171) [2025-02-06 14:37:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1812 transitions. [2025-02-06 14:37:43,515 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1812 transitions. Word has length 74 [2025-02-06 14:37:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:43,515 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1812 transitions. [2025-02-06 14:37:43,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1812 transitions. [2025-02-06 14:37:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:43,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:43,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:43,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:37:43,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:43,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash 830730131, now seen corresponding path program 1 times [2025-02-06 14:37:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930559277] [2025-02-06 14:37:43,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:43,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:43,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:43,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:43,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:37:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930559277] [2025-02-06 14:37:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930559277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:43,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:43,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:43,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142872589] [2025-02-06 14:37:43,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:43,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:43,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:43,599 INFO L87 Difference]: Start difference. First operand 1407 states and 1812 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:43,884 INFO L93 Difference]: Finished difference Result 2428 states and 3136 transitions. [2025-02-06 14:37:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 14:37:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:43,890 INFO L225 Difference]: With dead ends: 2428 [2025-02-06 14:37:43,890 INFO L226 Difference]: Without dead ends: 1354 [2025-02-06 14:37:43,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:43,892 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 208 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:43,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 468 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-02-06 14:37:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1242. [2025-02-06 14:37:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1010 states have (on average 1.300990099009901) internal successors, (1314), 1025 states have internal predecessors, (1314), 140 states have call successors, (140), 84 states have call predecessors, (140), 88 states have return successors, (144), 133 states have call predecessors, (144), 140 states have call successors, (144) [2025-02-06 14:37:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1598 transitions. [2025-02-06 14:37:43,975 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1598 transitions. Word has length 74 [2025-02-06 14:37:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:43,976 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1598 transitions. [2025-02-06 14:37:43,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1598 transitions. [2025-02-06 14:37:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:43,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:43,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:43,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:37:43,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:43,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash -91953452, now seen corresponding path program 1 times [2025-02-06 14:37:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592279246] [2025-02-06 14:37:43,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:43,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:43,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:37:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:44,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592279246] [2025-02-06 14:37:44,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592279246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:44,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:44,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597844098] [2025-02-06 14:37:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:44,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:44,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:44,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:44,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:44,045 INFO L87 Difference]: Start difference. First operand 1242 states and 1598 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:44,272 INFO L93 Difference]: Finished difference Result 2763 states and 3540 transitions. [2025-02-06 14:37:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:44,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 14:37:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:44,279 INFO L225 Difference]: With dead ends: 2763 [2025-02-06 14:37:44,280 INFO L226 Difference]: Without dead ends: 1532 [2025-02-06 14:37:44,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:44,283 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:44,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 261 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-02-06 14:37:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1492. [2025-02-06 14:37:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1234 states have (on average 1.2431118314424636) internal successors, (1534), 1249 states have internal predecessors, (1534), 146 states have call successors, (146), 104 states have call predecessors, (146), 108 states have return successors, (164), 139 states have call predecessors, (164), 146 states have call successors, (164) [2025-02-06 14:37:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1844 transitions. [2025-02-06 14:37:44,348 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1844 transitions. Word has length 74 [2025-02-06 14:37:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:44,348 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1844 transitions. [2025-02-06 14:37:44,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1844 transitions. [2025-02-06 14:37:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:37:44,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:44,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:44,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:37:44,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:44,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1540850547, now seen corresponding path program 1 times [2025-02-06 14:37:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392255364] [2025-02-06 14:37:44,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:44,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:37:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:37:44,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:44,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:37:44,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392255364] [2025-02-06 14:37:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392255364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:44,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:44,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856882598] [2025-02-06 14:37:44,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:44,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:44,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:44,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:44,383 INFO L87 Difference]: Start difference. First operand 1492 states and 1844 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:44,594 INFO L93 Difference]: Finished difference Result 4178 states and 5246 transitions. [2025-02-06 14:37:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2025-02-06 14:37:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:44,603 INFO L225 Difference]: With dead ends: 4178 [2025-02-06 14:37:44,603 INFO L226 Difference]: Without dead ends: 2697 [2025-02-06 14:37:44,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:44,606 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 171 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:44,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 338 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-02-06 14:37:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2614. [2025-02-06 14:37:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2149 states have (on average 1.2340623545835272) internal successors, (2652), 2176 states have internal predecessors, (2652), 263 states have call successors, (263), 180 states have call predecessors, (263), 198 states have return successors, (349), 259 states have call predecessors, (349), 263 states have call successors, (349) [2025-02-06 14:37:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3264 transitions. [2025-02-06 14:37:44,708 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3264 transitions. Word has length 74 [2025-02-06 14:37:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:44,708 INFO L471 AbstractCegarLoop]: Abstraction has 2614 states and 3264 transitions. [2025-02-06 14:37:44,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3264 transitions. [2025-02-06 14:37:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 14:37:44,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:44,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:44,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:37:44,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -441432416, now seen corresponding path program 1 times [2025-02-06 14:37:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278197450] [2025-02-06 14:37:44,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:44,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 14:37:44,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 14:37:44,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:44,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 14:37:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278197450] [2025-02-06 14:37:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278197450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849213474] [2025-02-06 14:37:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:44,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:44,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:44,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:44,728 INFO L87 Difference]: Start difference. First operand 2614 states and 3264 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:44,838 INFO L93 Difference]: Finished difference Result 4733 states and 5867 transitions. [2025-02-06 14:37:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 76 [2025-02-06 14:37:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:44,857 INFO L225 Difference]: With dead ends: 4733 [2025-02-06 14:37:44,857 INFO L226 Difference]: Without dead ends: 2130 [2025-02-06 14:37:44,865 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-02-06 14:37:44,869 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:44,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 147 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-02-06 14:37:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2100. [2025-02-06 14:37:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 1735 states have (on average 1.225936599423631) internal successors, (2127), 1759 states have internal predecessors, (2127), 203 states have call successors, (203), 142 states have call predecessors, (203), 158 states have return successors, (259), 199 states have call predecessors, (259), 203 states have call successors, (259) [2025-02-06 14:37:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2589 transitions. [2025-02-06 14:37:44,973 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2589 transitions. Word has length 76 [2025-02-06 14:37:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:44,974 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2589 transitions. [2025-02-06 14:37:44,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:37:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2589 transitions. [2025-02-06 14:37:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 14:37:44,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:44,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:44,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 14:37:44,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:44,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:44,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1213373931, now seen corresponding path program 1 times [2025-02-06 14:37:44,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:44,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716409015] [2025-02-06 14:37:44,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 14:37:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 14:37:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 14:37:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716409015] [2025-02-06 14:37:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716409015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404908914] [2025-02-06 14:37:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:45,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:45,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:45,030 INFO L87 Difference]: Start difference. First operand 2100 states and 2589 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:45,437 INFO L93 Difference]: Finished difference Result 5687 states and 7043 transitions. [2025-02-06 14:37:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 14:37:45,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 78 [2025-02-06 14:37:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:45,452 INFO L225 Difference]: With dead ends: 5687 [2025-02-06 14:37:45,452 INFO L226 Difference]: Without dead ends: 3598 [2025-02-06 14:37:45,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:37:45,456 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 581 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:45,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 503 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2025-02-06 14:37:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3529. [2025-02-06 14:37:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3529 states, 2916 states have (on average 1.2112482853223594) internal successors, (3532), 2958 states have internal predecessors, (3532), 335 states have call successors, (335), 237 states have call predecessors, (335), 274 states have return successors, (472), 335 states have call predecessors, (472), 335 states have call successors, (472) [2025-02-06 14:37:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4339 transitions. [2025-02-06 14:37:45,630 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4339 transitions. Word has length 78 [2025-02-06 14:37:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:45,630 INFO L471 AbstractCegarLoop]: Abstraction has 3529 states and 4339 transitions. [2025-02-06 14:37:45,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 14:37:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4339 transitions. [2025-02-06 14:37:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 14:37:45,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:45,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:45,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:37:45,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:45,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -784221536, now seen corresponding path program 1 times [2025-02-06 14:37:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:45,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742208041] [2025-02-06 14:37:45,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:45,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 14:37:45,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 14:37:45,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:45,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 14:37:45,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:45,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742208041] [2025-02-06 14:37:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742208041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:45,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:45,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012177658] [2025-02-06 14:37:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:45,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:37:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:45,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:37:45,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:37:45,713 INFO L87 Difference]: Start difference. First operand 3529 states and 4339 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:37:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:46,017 INFO L93 Difference]: Finished difference Result 5934 states and 7304 transitions. [2025-02-06 14:37:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2025-02-06 14:37:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:46,030 INFO L225 Difference]: With dead ends: 5934 [2025-02-06 14:37:46,030 INFO L226 Difference]: Without dead ends: 3547 [2025-02-06 14:37:46,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:46,035 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 147 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:46,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 349 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2025-02-06 14:37:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3539. [2025-02-06 14:37:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 2921 states have (on average 1.202670318384115) internal successors, (3513), 2967 states have internal predecessors, (3513), 335 states have call successors, (335), 237 states have call predecessors, (335), 279 states have return successors, (448), 336 states have call predecessors, (448), 335 states have call successors, (448) [2025-02-06 14:37:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 4296 transitions. [2025-02-06 14:37:46,222 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 4296 transitions. Word has length 92 [2025-02-06 14:37:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:46,222 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 4296 transitions. [2025-02-06 14:37:46,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:37:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 4296 transitions. [2025-02-06 14:37:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 14:37:46,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:46,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:46,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:37:46,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:46,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash 423696639, now seen corresponding path program 1 times [2025-02-06 14:37:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153422991] [2025-02-06 14:37:46,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:46,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 14:37:46,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 14:37:46,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:46,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 14:37:46,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153422991] [2025-02-06 14:37:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153422991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:37:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998966613] [2025-02-06 14:37:46,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:46,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:46,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:46,248 INFO L87 Difference]: Start difference. First operand 3539 states and 4296 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:46,327 INFO L93 Difference]: Finished difference Result 3541 states and 4296 transitions. [2025-02-06 14:37:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-02-06 14:37:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:46,337 INFO L225 Difference]: With dead ends: 3541 [2025-02-06 14:37:46,337 INFO L226 Difference]: Without dead ends: 2746 [2025-02-06 14:37:46,339 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-02-06 14:37:46,340 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:46,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2025-02-06 14:37:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2746. [2025-02-06 14:37:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2272 states have (on average 1.2099471830985915) internal successors, (2749), 2308 states have internal predecessors, (2749), 254 states have call successors, (254), 180 states have call predecessors, (254), 216 states have return successors, (351), 258 states have call predecessors, (351), 254 states have call successors, (351) [2025-02-06 14:37:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 3354 transitions. [2025-02-06 14:37:46,452 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 3354 transitions. Word has length 92 [2025-02-06 14:37:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:46,452 INFO L471 AbstractCegarLoop]: Abstraction has 2746 states and 3354 transitions. [2025-02-06 14:37:46,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 14:37:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3354 transitions. [2025-02-06 14:37:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 14:37:46,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:46,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:46,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:37:46,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:46,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash -286112470, now seen corresponding path program 1 times [2025-02-06 14:37:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586262467] [2025-02-06 14:37:46,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:46,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 14:37:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 14:37:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 14:37:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586262467] [2025-02-06 14:37:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586262467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:46,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:46,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:37:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537847824] [2025-02-06 14:37:46,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:46,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:46,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:46,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:46,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:46,543 INFO L87 Difference]: Start difference. First operand 2746 states and 3354 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 14:37:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:47,028 INFO L93 Difference]: Finished difference Result 5100 states and 6238 transitions. [2025-02-06 14:37:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 14:37:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 94 [2025-02-06 14:37:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:47,040 INFO L225 Difference]: With dead ends: 5100 [2025-02-06 14:37:47,040 INFO L226 Difference]: Without dead ends: 2939 [2025-02-06 14:37:47,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-02-06 14:37:47,047 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 847 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:47,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 740 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:37:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2025-02-06 14:37:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2746. [2025-02-06 14:37:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2272 states have (on average 1.2002640845070423) internal successors, (2727), 2308 states have internal predecessors, (2727), 254 states have call successors, (254), 180 states have call predecessors, (254), 216 states have return successors, (318), 258 states have call predecessors, (318), 254 states have call successors, (318) [2025-02-06 14:37:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 3299 transitions. [2025-02-06 14:37:47,152 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 3299 transitions. Word has length 94 [2025-02-06 14:37:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:47,152 INFO L471 AbstractCegarLoop]: Abstraction has 2746 states and 3299 transitions. [2025-02-06 14:37:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 14:37:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3299 transitions. [2025-02-06 14:37:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 14:37:47,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:47,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:47,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:37:47,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1211555483, now seen corresponding path program 1 times [2025-02-06 14:37:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722506425] [2025-02-06 14:37:47,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 14:37:47,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 14:37:47,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:47,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:37:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722506425] [2025-02-06 14:37:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722506425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:47,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:37:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679868436] [2025-02-06 14:37:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:47,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:37:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:47,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:37:47,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:47,216 INFO L87 Difference]: Start difference. First operand 2746 states and 3299 transitions. Second operand has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:37:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:47,314 INFO L93 Difference]: Finished difference Result 2746 states and 3299 transitions. [2025-02-06 14:37:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:37:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2025-02-06 14:37:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:47,322 INFO L225 Difference]: With dead ends: 2746 [2025-02-06 14:37:47,322 INFO L226 Difference]: Without dead ends: 2745 [2025-02-06 14:37:47,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:37:47,323 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:47,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2025-02-06 14:37:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2745. [2025-02-06 14:37:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2272 states have (on average 1.1976232394366197) internal successors, (2721), 2307 states have internal predecessors, (2721), 254 states have call successors, (254), 180 states have call predecessors, (254), 216 states have return successors, (318), 258 states have call predecessors, (318), 254 states have call successors, (318) [2025-02-06 14:37:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3293 transitions. [2025-02-06 14:37:47,437 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3293 transitions. Word has length 102 [2025-02-06 14:37:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:47,437 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 3293 transitions. [2025-02-06 14:37:47,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:37:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3293 transitions. [2025-02-06 14:37:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 14:37:47,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:47,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:47,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 14:37:47,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 14:37:47,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1096485766, now seen corresponding path program 1 times [2025-02-06 14:37:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875444433] [2025-02-06 14:37:47,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:47,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 14:37:47,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 14:37:47,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:47,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 14:37:47,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 14:37:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 14:37:47,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 14:37:47,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:47,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 14:37:47,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 14:37:47,490 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 14:37:47,494 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 14:37:47,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 14:37:47,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 14:37:47,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 14:37:47,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 14:37:47,497 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:47,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:37:47,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:37:47 BoogieIcfgContainer [2025-02-06 14:37:47,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:37:47,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:37:47,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:37:47,577 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:37:47,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:40" (3/4) ... [2025-02-06 14:37:47,578 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 14:37:47,628 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 74. [2025-02-06 14:37:47,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:37:47,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:37:47,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:37:47,683 INFO L158 Benchmark]: Toolchain (without parser) took 8196.51ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 105.0MB in the beginning and 229.9MB in the end (delta: -124.9MB). Peak memory consumption was 353.4MB. Max. memory is 16.1GB. [2025-02-06 14:37:47,683 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:47,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.18ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:37:47,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.85ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:47,683 INFO L158 Benchmark]: Boogie Preprocessor took 36.69ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:37:47,683 INFO L158 Benchmark]: IcfgBuilder took 382.11ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 69.5MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:37:47,684 INFO L158 Benchmark]: TraceAbstraction took 7430.48ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 69.5MB in the beginning and 246.7MB in the end (delta: -177.2MB). Peak memory consumption was 303.1MB. Max. memory is 16.1GB. [2025-02-06 14:37:47,684 INFO L158 Benchmark]: Witness Printer took 105.23ms. Allocated memory is still 620.8MB. Free memory was 246.7MB in the beginning and 229.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:37:47,685 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.27ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.18ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.85ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.69ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 382.11ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 69.5MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7430.48ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 69.5MB in the beginning and 246.7MB in the end (delta: -177.2MB). Peak memory consumption was 303.1MB. Max. memory is 16.1GB. * Witness Printer took 105.23ms. Allocated memory is still 620.8MB. Free memory was 246.7MB in the beginning and 229.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L341] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 118 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4227 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4129 mSDsluCounter, 7835 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5025 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3007 IncrementalHoareTripleChecker+Invalid, 3614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 2810 mSDtfsCounter, 3007 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3539occurred in iteration=15, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 798 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1394 NumberOfCodeBlocks, 1394 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1273 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 200/200 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-06 14:37:47,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)