./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 16:41:05,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 16:41:05,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 16:41:05,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 16:41:05,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 16:41:05,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 16:41:05,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 16:41:05,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 16:41:05,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 16:41:05,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 16:41:05,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 16:41:05,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 16:41:05,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 16:41:05,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 16:41:05,893 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 16:41:05,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 16:41:05,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 16:41:05,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:41:05,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 16:41:05,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 16:41:05,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 16:41:05,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 16:41:05,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 16:41:05,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 16:41:05,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 16:41:05,896 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b [2025-02-06 16:41:06,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 16:41:06,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 16:41:06,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 16:41:06,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 16:41:06,083 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 16:41:06,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2025-02-06 16:41:07,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e092a41b9/3af9c2dbe39b4520a2d911d6b72ca24c/FLAG439489f7c [2025-02-06 16:41:07,657 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 16:41:07,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2025-02-06 16:41:07,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e092a41b9/3af9c2dbe39b4520a2d911d6b72ca24c/FLAG439489f7c [2025-02-06 16:41:07,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e092a41b9/3af9c2dbe39b4520a2d911d6b72ca24c [2025-02-06 16:41:07,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 16:41:07,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 16:41:07,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 16:41:07,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 16:41:07,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 16:41:07,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:41:07" (1/1) ... [2025-02-06 16:41:07,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7850b508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:07, skipping insertion in model container [2025-02-06 16:41:07,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:41:07" (1/1) ... [2025-02-06 16:41:07,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 16:41:08,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:41:08,728 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 16:41:08,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:41:08,903 INFO L204 MainTranslator]: Completed translation [2025-02-06 16:41:08,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08 WrapperNode [2025-02-06 16:41:08,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 16:41:08,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 16:41:08,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 16:41:08,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 16:41:08,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,938 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2025-02-06 16:41:08,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 16:41:08,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 16:41:08,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 16:41:08,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 16:41:08,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,961 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 16:41:08,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 16:41:08,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 16:41:08,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 16:41:08,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 16:41:08,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (1/1) ... [2025-02-06 16:41:08,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:41:08,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 16:41:09,031 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 16:41:09,033 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 16:41:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 16:41:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 16:41:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 16:41:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 16:41:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 16:41:09,158 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 16:41:09,159 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 16:41:09,360 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-06 16:41:09,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 16:41:09,383 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 16:41:09,384 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 16:41:09,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:41:09 BoogieIcfgContainer [2025-02-06 16:41:09,385 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 16:41:09,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 16:41:09,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 16:41:09,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 16:41:09,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:41:07" (1/3) ... [2025-02-06 16:41:09,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200b25ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:41:09, skipping insertion in model container [2025-02-06 16:41:09,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:41:08" (2/3) ... [2025-02-06 16:41:09,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200b25ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:41:09, skipping insertion in model container [2025-02-06 16:41:09,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:41:09" (3/3) ... [2025-02-06 16:41:09,399 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2025-02-06 16:41:09,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 16:41:09,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_multiply_17_bad.i that has 2 procedures, 53 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-06 16:41:09,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 16:41:09,473 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;@19f18099, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 16:41:09,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 16:41:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 49 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 16:41:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 16:41:09,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:41:09,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:41:09,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:41:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:41:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1517696081, now seen corresponding path program 1 times [2025-02-06 16:41:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:41:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859507638] [2025-02-06 16:41:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:41:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:41:09,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 16:41:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 16:41:09,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:41:09,671 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 16:41:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:41:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859507638] [2025-02-06 16:41:09,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859507638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:41:09,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:41:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:41:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307777222] [2025-02-06 16:41:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:41:09,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:41:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:41:09,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:41:09,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:41:09,695 INFO L87 Difference]: Start difference. First operand has 53 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 49 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:41:09,731 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2025-02-06 16:41:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:41:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 16:41:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:41:09,738 INFO L225 Difference]: With dead ends: 98 [2025-02-06 16:41:09,738 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 16:41:09,740 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 16:41:09,742 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:41:09,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:41:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 16:41:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2025-02-06 16:41:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.55) internal successors, (62), 45 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2025-02-06 16:41:09,767 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 12 [2025-02-06 16:41:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:41:09,768 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2025-02-06 16:41:09,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2025-02-06 16:41:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 16:41:09,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:41:09,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:41:09,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 16:41:09,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:41:09,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:41:09,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1531187118, now seen corresponding path program 1 times [2025-02-06 16:41:09,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:41:09,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990261419] [2025-02-06 16:41:09,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:41:09,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:41:09,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 16:41:09,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 16:41:09,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:41:09,937 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 16:41:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:41:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990261419] [2025-02-06 16:41:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990261419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:41:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:41:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:41:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554845107] [2025-02-06 16:41:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:41:09,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 16:41:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:41:09,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 16:41:09,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:41:09,940 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:41:09,973 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2025-02-06 16:41:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 16:41:09,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 16:41:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:41:09,974 INFO L225 Difference]: With dead ends: 74 [2025-02-06 16:41:09,974 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 16:41:09,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:41:09,975 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:41:09,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:41:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 16:41:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 16:41:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.546875) internal successors, (99), 69 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-02-06 16:41:09,980 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 16 [2025-02-06 16:41:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:41:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-02-06 16:41:09,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-02-06 16:41:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 16:41:09,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:41:09,981 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] [2025-02-06 16:41:09,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 16:41:09,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:41:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:41:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash -796873144, now seen corresponding path program 1 times [2025-02-06 16:41:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:41:09,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457201749] [2025-02-06 16:41:09,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:41:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:41:10,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 16:41:10,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 16:41:10,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:41:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 16:41:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:41:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457201749] [2025-02-06 16:41:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457201749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:41:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:41:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 16:41:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433374474] [2025-02-06 16:41:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:41:10,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:41:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:41:10,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:41:10,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:41:10,040 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:41:10,069 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-06 16:41:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:41:10,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-06 16:41:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:41:10,070 INFO L225 Difference]: With dead ends: 90 [2025-02-06 16:41:10,070 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 16:41:10,071 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 16:41:10,072 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:41:10,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 111 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:41:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 16:41:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-02-06 16:41:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 73 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2025-02-06 16:41:10,080 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 21 [2025-02-06 16:41:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:41:10,080 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2025-02-06 16:41:10,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2025-02-06 16:41:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 16:41:10,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:41:10,081 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] [2025-02-06 16:41:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 16:41:10,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:41:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:41:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1066736297, now seen corresponding path program 1 times [2025-02-06 16:41:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:41:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43842813] [2025-02-06 16:41:10,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:41:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:41:10,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 16:41:10,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 16:41:10,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:10,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:41:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:41:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:41:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43842813] [2025-02-06 16:41:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43842813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:41:10,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:41:10,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 16:41:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951041861] [2025-02-06 16:41:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:41:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 16:41:10,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:41:10,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 16:41:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 16:41:10,238 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:41:10,372 INFO L93 Difference]: Finished difference Result 129 states and 175 transitions. [2025-02-06 16:41:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 16:41:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 16:41:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:41:10,375 INFO L225 Difference]: With dead ends: 129 [2025-02-06 16:41:10,375 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 16:41:10,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 16:41:10,376 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 16:41:10,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 336 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 16:41:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 16:41:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2025-02-06 16:41:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 87 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-02-06 16:41:10,386 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 22 [2025-02-06 16:41:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:41:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-02-06 16:41:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-02-06 16:41:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 16:41:10,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:41:10,387 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] [2025-02-06 16:41:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 16:41:10,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:41:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:41:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1066737130, now seen corresponding path program 1 times [2025-02-06 16:41:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:41:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134180420] [2025-02-06 16:41:10,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:41:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:41:10,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 16:41:10,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 16:41:10,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:41:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 16:41:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:41:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134180420] [2025-02-06 16:41:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134180420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:41:10,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:41:10,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:41:10,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357566087] [2025-02-06 16:41:10,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:41:10,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 16:41:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:41:10,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 16:41:10,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:41:10,461 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:41:10,490 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2025-02-06 16:41:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 16:41:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 16:41:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:41:10,491 INFO L225 Difference]: With dead ends: 109 [2025-02-06 16:41:10,492 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 16:41:10,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:41:10,493 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:41:10,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 157 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:41:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 16:41:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-02-06 16:41:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 103 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2025-02-06 16:41:10,503 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 22 [2025-02-06 16:41:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:41:10,503 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2025-02-06 16:41:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 16:41:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2025-02-06 16:41:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 16:41:10,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:41:10,504 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] [2025-02-06 16:41:10,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 16:41:10,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 16:41:10,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:41:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash -903122346, now seen corresponding path program 1 times [2025-02-06 16:41:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:41:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210509381] [2025-02-06 16:41:10,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:41:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:41:10,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 16:41:10,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 16:41:10,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 16:41:10,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 16:41:10,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 16:41:10,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 16:41:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:41:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 16:41:10,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 16:41:10,542 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 16:41:10,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 16:41:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 16:41:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 16:41:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 16:41:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 16:41:10,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 16:41:10,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 16:41:10,546 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 16:41:10,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 16:41:10,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:41:10 BoogieIcfgContainer [2025-02-06 16:41:10,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 16:41:10,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 16:41:10,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 16:41:10,564 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 16:41:10,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:41:09" (3/4) ... [2025-02-06 16:41:10,565 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 16:41:10,592 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 16:41:10,620 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 16:41:10,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 16:41:10,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 16:41:10,621 INFO L158 Benchmark]: Toolchain (without parser) took 2776.40ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 57.2MB in the end (delta: 50.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2025-02-06 16:41:10,622 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:41:10,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1056.45ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 49.5MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 16:41:10,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.69ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 46.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:41:10,622 INFO L158 Benchmark]: Boogie Preprocessor took 29.75ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 45.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:41:10,622 INFO L158 Benchmark]: IcfgBuilder took 414.62ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 97.1MB in the end (delta: -51.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-02-06 16:41:10,622 INFO L158 Benchmark]: TraceAbstraction took 1176.85ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 63.2MB in the end (delta: 33.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2025-02-06 16:41:10,623 INFO L158 Benchmark]: Witness Printer took 57.29ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 57.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:41:10,624 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1056.45ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 49.5MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.69ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 46.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.75ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 45.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 414.62ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 97.1MB in the end (delta: -51.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1176.85ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 63.2MB in the end (delta: 33.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 57.29ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 57.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1561]: integer overflow possible integer overflow possible We found a FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1559] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1561] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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 2 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 888 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 579 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 309 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3/3 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 16:41:10,636 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)