./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b593e09c1e411bcfd0f33c8ec9270914844cea754607fa1ad6893957bd26d1f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:19:56,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:19:56,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:19:56,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:19:56,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:19:56,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:19:56,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:19:56,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:19:56,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:19:56,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:19:56,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:19:56,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:19:56,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:19:56,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:19:56,755 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:19:56,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:19:56,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:19:56,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:19:56,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:19:56,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:19:56,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:19:56,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:19:56,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:19:56,759 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:19:56,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:19:56,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:19:56,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:19:56,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:19:56,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:19:56,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:19:56,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:19:56,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:19:56,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:19:56,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:19:56,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:19:56,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:19:56,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:19:56,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:19:56,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:19:56,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:19:56,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:19:56,763 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> b593e09c1e411bcfd0f33c8ec9270914844cea754607fa1ad6893957bd26d1f7 [2024-10-11 23:19:56,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:19:57,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:19:57,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:19:57,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:19:57,006 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:19:57,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_good.i [2024-10-11 23:19:58,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:19:58,622 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:19:58,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_good.i [2024-10-11 23:19:58,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5d92b272/6aebaf49fd8548a3af14f51f4af154a8/FLAG2e25db025 [2024-10-11 23:19:58,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5d92b272/6aebaf49fd8548a3af14f51f4af154a8 [2024-10-11 23:19:58,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:19:58,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:19:58,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:19:58,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:19:58,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:19:58,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:19:58" (1/1) ... [2024-10-11 23:19:58,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca6d40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:58, skipping insertion in model container [2024-10-11 23:19:58,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:19:58" (1/1) ... [2024-10-11 23:19:58,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:19:59,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:19:59,368 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:19:59,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:19:59,547 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:19:59,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59 WrapperNode [2024-10-11 23:19:59,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:19:59,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:19:59,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:19:59,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:19:59,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,599 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2024-10-11 23:19:59,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:19:59,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:19:59,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:19:59,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:19:59,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,623 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:19:59,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:19:59,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:19:59,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:19:59,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:19:59,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (1/1) ... [2024-10-11 23:19:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:19:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:19:59,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:19:59,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:19:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:19:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:19:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:19:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:19:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:19:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:19:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:19:59,818 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:19:59,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:20:00,072 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-11 23:20:00,072 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:20:00,091 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:20:00,091 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 23:20:00,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:00 BoogieIcfgContainer [2024-10-11 23:20:00,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:20:00,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:20:00,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:20:00,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:20:00,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:19:58" (1/3) ... [2024-10-11 23:20:00,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e421aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:00, skipping insertion in model container [2024-10-11 23:20:00,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:59" (2/3) ... [2024-10-11 23:20:00,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e421aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:00, skipping insertion in model container [2024-10-11 23:20:00,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:00" (3/3) ... [2024-10-11 23:20:00,101 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_17_good.i [2024-10-11 23:20:00,115 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:20:00,115 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 23:20:00,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:20:00,169 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;@48656318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:20:00,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 23:20:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 66 states have internal predecessors, (89), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 23:20:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 23:20:00,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:00,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:00,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1763285373, now seen corresponding path program 1 times [2024-10-11 23:20:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57205306] [2024-10-11 23:20:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57205306] [2024-10-11 23:20:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57205306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:00,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121936999] [2024-10-11 23:20:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:00,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:00,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:00,511 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 66 states have internal predecessors, (89), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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) [2024-10-11 23:20:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:00,561 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2024-10-11 23:20:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:00,566 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 [2024-10-11 23:20:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:00,576 INFO L225 Difference]: With dead ends: 141 [2024-10-11 23:20:00,576 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 23:20:00,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:00,581 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:00,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 170 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 23:20:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2024-10-11 23:20:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 64 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-10-11 23:20:00,620 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 12 [2024-10-11 23:20:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:00,621 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-10-11 23:20:00,621 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) [2024-10-11 23:20:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-10-11 23:20:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 23:20:00,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:00,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:00,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:20:00,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 78825496, now seen corresponding path program 1 times [2024-10-11 23:20:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895355283] [2024-10-11 23:20:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895355283] [2024-10-11 23:20:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895355283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024001740] [2024-10-11 23:20:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:00,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:00,762 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-10-11 23:20:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:00,817 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2024-10-11 23:20:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-10-11 23:20:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:00,822 INFO L225 Difference]: With dead ends: 97 [2024-10-11 23:20:00,822 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 23:20:00,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:00,824 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:00,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 239 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 23:20:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 23:20:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 88 states have internal predecessors, (120), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-10-11 23:20:00,836 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 15 [2024-10-11 23:20:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:00,836 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-10-11 23:20:00,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-10-11 23:20:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-10-11 23:20:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 23:20:00,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:00,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:20:00,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:00,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -136497909, now seen corresponding path program 1 times [2024-10-11 23:20:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908210072] [2024-10-11 23:20:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:00,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:20:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908210072] [2024-10-11 23:20:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908210072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:00,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:20:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323962139] [2024-10-11 23:20:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:00,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:00,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:00,920 INFO L87 Difference]: Start difference. First operand 95 states and 128 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) [2024-10-11 23:20:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:00,939 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2024-10-11 23:20:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:00,940 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 [2024-10-11 23:20:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:00,940 INFO L225 Difference]: With dead ends: 95 [2024-10-11 23:20:00,941 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 23:20:00,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:00,942 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 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 [2024-10-11 23:20:00,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 23:20:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 23:20:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 87 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-10-11 23:20:00,956 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 21 [2024-10-11 23:20:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:00,957 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-10-11 23:20:00,957 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) [2024-10-11 23:20:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-10-11 23:20:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 23:20:00,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:00,958 INFO L215 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] [2024-10-11 23:20:00,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:20:00,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:00,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash 63494512, now seen corresponding path program 1 times [2024-10-11 23:20:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:00,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299804071] [2024-10-11 23:20:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:20:01,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299804071] [2024-10-11 23:20:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299804071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167307605] [2024-10-11 23:20:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:01,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:20:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:20:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:01,014 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2024-10-11 23:20:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:01,042 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2024-10-11 23:20:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:20:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 [2024-10-11 23:20:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:01,043 INFO L225 Difference]: With dead ends: 124 [2024-10-11 23:20:01,044 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 23:20:01,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:20:01,045 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:01,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 159 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 23:20:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2024-10-11 23:20:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 88 states have internal predecessors, (120), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-10-11 23:20:01,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 22 [2024-10-11 23:20:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:01,052 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-10-11 23:20:01,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2024-10-11 23:20:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-10-11 23:20:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 23:20:01,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:01,053 INFO L215 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] [2024-10-11 23:20:01,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:20:01,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash 63532273, now seen corresponding path program 1 times [2024-10-11 23:20:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560651224] [2024-10-11 23:20:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560651224] [2024-10-11 23:20:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560651224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339495946] [2024-10-11 23:20:01,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:01,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:01,149 INFO L87 Difference]: Start difference. First operand 95 states and 128 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) [2024-10-11 23:20:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:01,196 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2024-10-11 23:20:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:01,196 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 [2024-10-11 23:20:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:01,197 INFO L225 Difference]: With dead ends: 95 [2024-10-11 23:20:01,197 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 23:20:01,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:01,199 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 46 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:01,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 181 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 23:20:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 23:20:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 87 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-10-11 23:20:01,205 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 22 [2024-10-11 23:20:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:01,205 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-10-11 23:20:01,205 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) [2024-10-11 23:20:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-10-11 23:20:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 23:20:01,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:01,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:20:01,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1580869174, now seen corresponding path program 1 times [2024-10-11 23:20:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135825138] [2024-10-11 23:20:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135825138] [2024-10-11 23:20:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135825138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622476403] [2024-10-11 23:20:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:01,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:01,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:01,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:01,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 23:20:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:20:01,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:20:01,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622476403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:01,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:01,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:20:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33890481] [2024-10-11 23:20:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:01,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:20:01,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:20:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:01,457 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-10-11 23:20:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:01,490 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2024-10-11 23:20:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:20:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 24 [2024-10-11 23:20:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:01,492 INFO L225 Difference]: With dead ends: 134 [2024-10-11 23:20:01,492 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 23:20:01,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:01,493 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:01,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 268 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 23:20:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 23:20:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.462962962962963) internal successors, (79), 61 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-11 23:20:01,501 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 24 [2024-10-11 23:20:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:01,501 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-11 23:20:01,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-10-11 23:20:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-11 23:20:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 23:20:01,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:01,502 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:01,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 23:20:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:01,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1102059512, now seen corresponding path program 1 times [2024-10-11 23:20:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256473151] [2024-10-11 23:20:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 23:20:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256473151] [2024-10-11 23:20:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256473151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:01,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086905257] [2024-10-11 23:20:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:01,770 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-10-11 23:20:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:01,804 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2024-10-11 23:20:01,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 23:20:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:01,805 INFO L225 Difference]: With dead ends: 80 [2024-10-11 23:20:01,805 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 23:20:01,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:01,806 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 5 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:01,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 23:20:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 23:20:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 69 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-10-11 23:20:01,817 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 28 [2024-10-11 23:20:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-10-11 23:20:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-10-11 23:20:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-10-11 23:20:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 23:20:01,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:01,819 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:01,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:20:01,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:01,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1014826324, now seen corresponding path program 1 times [2024-10-11 23:20:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950682511] [2024-10-11 23:20:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950682511] [2024-10-11 23:20:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950682511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:01,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365804773] [2024-10-11 23:20:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:01,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:01,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:01,890 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:01,922 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2024-10-11 23:20:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-10-11 23:20:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:01,923 INFO L225 Difference]: With dead ends: 97 [2024-10-11 23:20:01,923 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 23:20:01,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:01,924 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:01,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 23:20:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 23:20:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2024-10-11 23:20:01,932 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 33 [2024-10-11 23:20:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:01,933 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2024-10-11 23:20:01,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2024-10-11 23:20:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 23:20:01,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:01,934 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:01,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:20:01,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash 416408017, now seen corresponding path program 1 times [2024-10-11 23:20:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016009320] [2024-10-11 23:20:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016009320] [2024-10-11 23:20:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016009320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106632394] [2024-10-11 23:20:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:02,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:02,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:02,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:02,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 23:20:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:20:02,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:02,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:02,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106632394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:02,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:02,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:20:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565188800] [2024-10-11 23:20:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:02,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:20:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:20:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:02,110 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:02,128 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2024-10-11 23:20:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:20:02,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-11 23:20:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:02,130 INFO L225 Difference]: With dead ends: 96 [2024-10-11 23:20:02,130 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 23:20:02,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:02,131 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:02,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 23:20:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 23:20:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 68 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-10-11 23:20:02,135 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 36 [2024-10-11 23:20:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:02,135 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-10-11 23:20:02,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-10-11 23:20:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 23:20:02,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:02,136 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:02,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 23:20:02,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:02,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:02,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 734400244, now seen corresponding path program 1 times [2024-10-11 23:20:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582741951] [2024-10-11 23:20:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:02,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:02,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582741951] [2024-10-11 23:20:02,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582741951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:02,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:02,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:02,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906383938] [2024-10-11 23:20:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:02,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:02,401 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:02,424 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-10-11 23:20:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-10-11 23:20:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:02,427 INFO L225 Difference]: With dead ends: 81 [2024-10-11 23:20:02,427 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 23:20:02,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:02,427 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 218 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 [2024-10-11 23:20:02,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 23:20:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-11 23:20:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.353846153846154) internal successors, (88), 70 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:20:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2024-10-11 23:20:02,436 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 38 [2024-10-11 23:20:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:02,437 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2024-10-11 23:20:02,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2024-10-11 23:20:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 23:20:02,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:02,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:02,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 23:20:02,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:02,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -328939300, now seen corresponding path program 1 times [2024-10-11 23:20:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332827138] [2024-10-11 23:20:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:20:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 23:20:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332827138] [2024-10-11 23:20:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332827138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392237112] [2024-10-11 23:20:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:02,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:02,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:02,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:02,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 23:20:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:20:02,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 23:20:02,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392237112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:02,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:20:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041851502] [2024-10-11 23:20:02,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:02,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:20:02,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:02,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:20:02,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:02,607 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:20:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:02,643 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-10-11 23:20:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:20:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-10-11 23:20:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:02,644 INFO L225 Difference]: With dead ends: 105 [2024-10-11 23:20:02,644 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 23:20:02,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:02,645 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:02,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 270 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 23:20:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 23:20:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 60 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-10-11 23:20:02,650 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 39 [2024-10-11 23:20:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:02,650 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-10-11 23:20:02,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:20:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-10-11 23:20:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 23:20:02,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:02,651 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:02,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 23:20:02,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:02,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:02,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1291571286, now seen corresponding path program 1 times [2024-10-11 23:20:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:02,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979529717] [2024-10-11 23:20:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:20:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979529717] [2024-10-11 23:20:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979529717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141721121] [2024-10-11 23:20:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:02,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:02,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:02,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:02,905 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:02,923 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-10-11 23:20:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-10-11 23:20:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:02,925 INFO L225 Difference]: With dead ends: 67 [2024-10-11 23:20:02,925 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 23:20:02,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:02,926 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 5 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:02,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 205 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 23:20:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 23:20:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 59 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:20:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-10-11 23:20:02,930 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 39 [2024-10-11 23:20:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:02,930 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-10-11 23:20:02,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:20:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-10-11 23:20:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 23:20:02,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:02,932 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:02,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 23:20:02,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:02,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash 664851218, now seen corresponding path program 1 times [2024-10-11 23:20:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278106697] [2024-10-11 23:20:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 23:20:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 23:20:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278106697] [2024-10-11 23:20:02,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278106697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:02,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:20:02,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:20:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510459160] [2024-10-11 23:20:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:02,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:20:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:20:02,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:02,993 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:03,017 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-10-11 23:20:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:20:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-10-11 23:20:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:03,018 INFO L225 Difference]: With dead ends: 73 [2024-10-11 23:20:03,019 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 23:20:03,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:20:03,019 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 214 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 [2024-10-11 23:20:03,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 214 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 23:20:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 23:20:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 63 states have internal predecessors, (79), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 23:20:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2024-10-11 23:20:03,026 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 44 [2024-10-11 23:20:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2024-10-11 23:20:03,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2024-10-11 23:20:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 23:20:03,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:20:03,028 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 23:20:03,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 23:20:03,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:20:03,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:20:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1806325566, now seen corresponding path program 1 times [2024-10-11 23:20:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:20:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975241012] [2024-10-11 23:20:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:20:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:20:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:20:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 23:20:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 23:20:03,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:20:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975241012] [2024-10-11 23:20:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975241012] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:20:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282171566] [2024-10-11 23:20:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:20:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:20:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:20:03,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:20:03,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 23:20:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:20:03,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:20:03,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:20:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 23:20:03,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:20:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282171566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:20:03,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:20:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:20:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628941010] [2024-10-11 23:20:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:20:03,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:20:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:20:03,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:20:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:03,259 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:20:03,285 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2024-10-11 23:20:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:20:03,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-10-11 23:20:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:20:03,286 INFO L225 Difference]: With dead ends: 74 [2024-10-11 23:20:03,287 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:20:03,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:20:03,287 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:20:03,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:20:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:20:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:20:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:20:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:20:03,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-10-11 23:20:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:20:03,289 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:20:03,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:20:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:20:03,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:20:03,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-11 23:20:03,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-11 23:20:03,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-11 23:20:03,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-11 23:20:03,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 23:20:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 23:20:03,496 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:20:03,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:20:03,565 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:20:03,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:20:03 BoogieIcfgContainer [2024-10-11 23:20:03,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:20:03,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:20:03,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:20:03,585 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:20:03,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:00" (3/4) ... [2024-10-11 23:20:03,587 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:20:03,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:20:03,592 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:20:03,598 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-11 23:20:03,599 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 23:20:03,599 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:20:03,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:20:03,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:20:03,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:20:03,707 INFO L158 Benchmark]: Toolchain (without parser) took 5042.54ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 74.0MB in the beginning and 168.2MB in the end (delta: -94.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:20:03,707 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:20:03,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 882.42ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 73.7MB in the beginning and 116.9MB in the end (delta: -43.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-10-11 23:20:03,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.89ms. Allocated memory is still 195.0MB. Free memory was 116.9MB in the beginning and 113.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:20:03,708 INFO L158 Benchmark]: Boogie Preprocessor took 38.40ms. Allocated memory is still 195.0MB. Free memory was 113.8MB in the beginning and 111.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:20:03,708 INFO L158 Benchmark]: RCFGBuilder took 453.79ms. Allocated memory is still 195.0MB. Free memory was 111.7MB in the beginning and 89.7MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 23:20:03,708 INFO L158 Benchmark]: TraceAbstraction took 3489.81ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 88.6MB in the beginning and 175.4MB in the end (delta: -86.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:20:03,708 INFO L158 Benchmark]: Witness Printer took 121.68ms. Allocated memory is still 234.9MB. Free memory was 175.4MB in the beginning and 168.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:20:03,710 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.21ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 882.42ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 73.7MB in the beginning and 116.9MB in the end (delta: -43.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.89ms. Allocated memory is still 195.0MB. Free memory was 116.9MB in the beginning and 113.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.40ms. Allocated memory is still 195.0MB. Free memory was 113.8MB in the beginning and 111.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.79ms. Allocated memory is still 195.0MB. Free memory was 111.7MB in the beginning and 89.7MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3489.81ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 88.6MB in the beginning and 175.4MB in the end (delta: -86.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 121.68ms. Allocated memory is still 234.9MB. Free memory was 175.4MB in the beginning and 168.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 2970 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1888 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1082 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 548 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 119/123 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant Derived loop invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((1 <= k) && (data <= 2147483647)) || ((k == 0) && (data <= 2147483647))) - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: (((j == 0) && (((long) data + 2) == 0)) || ((1 <= j) && (((long) data + 2) <= 0))) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((i == 0) && (data <= 2147483647)) || ((1 <= i) && (data <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 23:20:03,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Result: TRUE