./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aaead44d7f76ddac498383f5d9663622bc4506781697c14d3a4988231066e32 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:12:46,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:12:46,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:12:46,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:12:46,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:12:46,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:12:46,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:12:46,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:12:46,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:12:46,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:12:46,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:12:46,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:12:46,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:12:46,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:12:46,475 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:12:46,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:12:46,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:12:46,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:12:46,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:12:46,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:12:46,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:12:46,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:12:46,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:12:46,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:12:46,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:12:46,480 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:12:46,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:12:46,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:12:46,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:12:46,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:12:46,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:12:46,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:12:46,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:12:46,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:12:46,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:12:46,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:12:46,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:12:46,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:12:46,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:12:46,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:12:46,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:12:46,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:12:46,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:12:46,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:12:46,484 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/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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6aaead44d7f76ddac498383f5d9663622bc4506781697c14d3a4988231066e32 [2024-10-13 13:12:46,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:12:46,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:12:46,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:12:46,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:12:46,698 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:12:46,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i [2024-10-13 13:12:47,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:12:48,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:12:48,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i [2024-10-13 13:12:48,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffbcc4e4/c4353b083c1846e79c5a1e57ee2d3eb7/FLAGe6c5ed83a [2024-10-13 13:12:48,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffbcc4e4/c4353b083c1846e79c5a1e57ee2d3eb7 [2024-10-13 13:12:48,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:12:48,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:12:48,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:12:48,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:12:48,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:12:48,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cc870c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48, skipping insertion in model container [2024-10-13 13:12:48,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:12:48,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:12:48,669 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:12:48,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:12:48,721 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:12:48,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48 WrapperNode [2024-10-13 13:12:48,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:12:48,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:12:48,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:12:48,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:12:48,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,765 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-10-13 13:12:48,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:12:48,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:12:48,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:12:48,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:12:48,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,794 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:12:48,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:12:48,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:12:48,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:12:48,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:12:48,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (1/1) ... [2024-10-13 13:12:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:12:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:48,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:12:48,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:12:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:12:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:12:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:12:48,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:12:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:12:48,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:12:48,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:12:48,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:12:49,039 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 13:12:49,040 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:12:49,063 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:12:49,063 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 13:12:49,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:49 BoogieIcfgContainer [2024-10-13 13:12:49,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:12:49,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:12:49,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:12:49,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:12:49,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:12:48" (1/3) ... [2024-10-13 13:12:49,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24da7bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:12:49, skipping insertion in model container [2024-10-13 13:12:49,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:48" (2/3) ... [2024-10-13 13:12:49,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24da7bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:12:49, skipping insertion in model container [2024-10-13 13:12:49,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:49" (3/3) ... [2024-10-13 13:12:49,071 INFO L112 eAbstractionObserver]: Analyzing ICFG id_trans.i [2024-10-13 13:12:49,084 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:12:49,084 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-13 13:12:49,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:12:49,129 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;@205122b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:12:49,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-13 13:12:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:12:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 13:12:49,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 13:12:49,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 3258, now seen corresponding path program 1 times [2024-10-13 13:12:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410629778] [2024-10-13 13:12:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,297 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-13 13:12:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:49,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410629778] [2024-10-13 13:12:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410629778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:49,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:49,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:12:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959835939] [2024-10-13 13:12:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:49,323 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 13:12:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:49,369 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-10-13 13:12:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:49,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 13:12:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:49,375 INFO L225 Difference]: With dead ends: 66 [2024-10-13 13:12:49,376 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 13:12:49,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-13 13:12:49,380 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:49,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 13:12:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 13:12:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:12:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-13 13:12:49,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 2 [2024-10-13 13:12:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:49,411 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-13 13:12:49,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 13:12:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-10-13 13:12:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 13:12:49,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 13:12:49,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:12:49,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:49,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 101034, now seen corresponding path program 1 times [2024-10-13 13:12:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:49,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724657920] [2024-10-13 13:12:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,496 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-13 13:12:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724657920] [2024-10-13 13:12:49,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724657920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:49,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:49,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24057817] [2024-10-13 13:12:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:49,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:49,499 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 13:12:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:49,515 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-10-13 13:12:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 13:12:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:49,516 INFO L225 Difference]: With dead ends: 30 [2024-10-13 13:12:49,516 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:12:49,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:49,518 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:49,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:12:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 13:12:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:12:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-13 13:12:49,527 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 3 [2024-10-13 13:12:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:49,527 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-13 13:12:49,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 13:12:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-13 13:12:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:12:49,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,528 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:12:49,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -310213727, now seen corresponding path program 1 times [2024-10-13 13:12:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:49,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365486670] [2024-10-13 13:12:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:12:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:12:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365486670] [2024-10-13 13:12:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365486670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928865493] [2024-10-13 13:12:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:49,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:49,685 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-13 13:12:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:49,756 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-13 13:12:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-13 13:12:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:49,759 INFO L225 Difference]: With dead ends: 44 [2024-10-13 13:12:49,759 INFO L226 Difference]: Without dead ends: 40 [2024-10-13 13:12:49,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 13:12:49,760 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:49,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-13 13:12:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-13 13:12:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:12:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-13 13:12:49,771 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 18 [2024-10-13 13:12:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:49,771 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-13 13:12:49,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-13 13:12:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-13 13:12:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:12:49,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,772 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:49,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:12:49,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash 406570142, now seen corresponding path program 1 times [2024-10-13 13:12:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774112152] [2024-10-13 13:12:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:12:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:12:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:12:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 13:12:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774112152] [2024-10-13 13:12:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774112152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:49,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:49,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251940740] [2024-10-13 13:12:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:49,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:49,925 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 13:12:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:49,973 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-13 13:12:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:49,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-10-13 13:12:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:49,974 INFO L225 Difference]: With dead ends: 44 [2024-10-13 13:12:49,974 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 13:12:49,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-13 13:12:49,975 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:49,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 13:12:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 13:12:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 32 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:12:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-13 13:12:49,987 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 33 [2024-10-13 13:12:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:49,987 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-13 13:12:49,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 13:12:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-13 13:12:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 13:12:49,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:49,990 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:49,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:12:49,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:49,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 455939787, now seen corresponding path program 1 times [2024-10-13 13:12:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065037305] [2024-10-13 13:12:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:12:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:12:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:12:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:12:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:12:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065037305] [2024-10-13 13:12:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065037305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23033395] [2024-10-13 13:12:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:50,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:50,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:12:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:12:50,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:12:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23033395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:12:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 13:12:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231404478] [2024-10-13 13:12:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:50,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:12:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:12:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:12:50,297 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 13:12:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:50,354 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-13 13:12:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:12:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-13 13:12:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:50,355 INFO L225 Difference]: With dead ends: 42 [2024-10-13 13:12:50,355 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 13:12:50,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 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-13 13:12:50,356 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:50,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 13:12:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 13:12:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:12:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-13 13:12:50,366 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 48 [2024-10-13 13:12:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:50,366 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-13 13:12:50,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 13:12:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-13 13:12:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 13:12:50,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:50,367 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:50,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 13:12:50,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:50,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1249231568, now seen corresponding path program 1 times [2024-10-13 13:12:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113214943] [2024-10-13 13:12:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:12:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:12:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:12:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:12:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:12:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113214943] [2024-10-13 13:12:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113214943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215374196] [2024-10-13 13:12:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:50,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:50,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:12:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:50,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 13:12:50,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 13:12:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215374196] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:50,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:50,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-13 13:12:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416274685] [2024-10-13 13:12:50,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:50,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 13:12:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 13:12:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:12:50,971 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-13 13:12:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:51,070 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-10-13 13:12:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:12:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2024-10-13 13:12:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:51,072 INFO L225 Difference]: With dead ends: 51 [2024-10-13 13:12:51,072 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 13:12:51,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:12:51,073 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:51,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 13:12:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-10-13 13:12:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:12:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-10-13 13:12:51,085 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 49 [2024-10-13 13:12:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:51,085 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-10-13 13:12:51,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-13 13:12:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-10-13 13:12:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 13:12:51,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:51,089 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:51,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:12:51,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 13:12:51,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1329581715, now seen corresponding path program 1 times [2024-10-13 13:12:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599538872] [2024-10-13 13:12:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:12:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:12:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:12:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:12:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:12:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 13:12:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 13:12:51,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599538872] [2024-10-13 13:12:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599538872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721575798] [2024-10-13 13:12:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:51,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:51,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:12:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:51,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:12:51,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 13:12:51,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 13:12:51,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721575798] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:51,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 13:12:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621635202] [2024-10-13 13:12:51,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:51,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:12:51,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:12:51,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:12:51,614 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-13 13:12:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:51,689 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2024-10-13 13:12:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:12:51,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 64 [2024-10-13 13:12:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:51,691 INFO L225 Difference]: With dead ends: 80 [2024-10-13 13:12:51,691 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 13:12:51,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:12:51,694 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:51,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 13:12:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 13:12:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 13:12:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2024-10-13 13:12:51,708 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 64 [2024-10-13 13:12:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:51,709 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2024-10-13 13:12:51,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-13 13:12:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2024-10-13 13:12:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 13:12:51,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:51,710 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-13 13:12:51,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:12:51,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:51,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:12:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1129245457, now seen corresponding path program 2 times [2024-10-13 13:12:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:51,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16599494] [2024-10-13 13:12:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 13:12:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 13:12:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 13:12:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:12:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:12:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:12:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 13:12:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 13:12:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 13:12:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 13:12:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 13:12:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:12:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 13:12:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 13:12:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 13:12:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 13:12:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 13:12:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 13:12:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 13:12:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16599494] [2024-10-13 13:12:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16599494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906525011] [2024-10-13 13:12:52,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:12:52,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:52,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:12:52,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:12:52,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 13:12:52,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:52,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:12:52,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2024-10-13 13:12:52,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2024-10-13 13:12:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906525011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:52,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-10-13 13:12:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394969486] [2024-10-13 13:12:52,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:12:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:12:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:12:52,568 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-13 13:12:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:52,773 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2024-10-13 13:12:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 13:12:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 154 [2024-10-13 13:12:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:52,774 INFO L225 Difference]: With dead ends: 96 [2024-10-13 13:12:52,774 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:12:52,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-13 13:12:52,775 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:52,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:12:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:12:52,777 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-13 13:12:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:12:52,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2024-10-13 13:12:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:52,778 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:12:52,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-13 13:12:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:12:52,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:12:52,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-13 13:12:52,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-13 13:12:52,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-13 13:12:52,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-13 13:12:52,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:12:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:52,988 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:52,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:12:53,321 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:12:53,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:12:53 BoogieIcfgContainer [2024-10-13 13:12:53,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:12:53,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:12:53,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:12:53,334 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:12:53,335 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:49" (3/4) ... [2024-10-13 13:12:53,336 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:12:53,339 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:12:53,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 13:12:53,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 13:12:53,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:12:53,342 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:12:53,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:12:53,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:12:53,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:12:53,422 INFO L158 Benchmark]: Toolchain (without parser) took 4940.54ms. Allocated memory was 197.1MB in the beginning and 281.0MB in the end (delta: 83.9MB). Free memory was 125.0MB in the beginning and 247.2MB in the end (delta: -122.2MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,422 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 197.1MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:12:53,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.06ms. Allocated memory is still 197.1MB. Free memory was 124.8MB in the beginning and 164.9MB in the end (delta: -40.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.73ms. Allocated memory is still 197.1MB. Free memory was 164.9MB in the beginning and 166.6MB in the end (delta: -1.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,422 INFO L158 Benchmark]: Boogie Preprocessor took 34.78ms. Allocated memory is still 197.1MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,423 INFO L158 Benchmark]: RCFGBuilder took 262.13ms. Allocated memory is still 197.1MB. Free memory was 164.5MB in the beginning and 149.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,423 INFO L158 Benchmark]: TraceAbstraction took 4269.23ms. Allocated memory was 197.1MB in the beginning and 281.0MB in the end (delta: 83.9MB). Free memory was 148.7MB in the beginning and 88.0MB in the end (delta: 60.7MB). Peak memory consumption was 145.7MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,423 INFO L158 Benchmark]: Witness Printer took 86.92ms. Allocated memory is still 281.0MB. Free memory was 88.0MB in the beginning and 247.2MB in the end (delta: -159.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:12:53,424 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.68ms. Allocated memory is still 197.1MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.06ms. Allocated memory is still 197.1MB. Free memory was 124.8MB in the beginning and 164.9MB in the end (delta: -40.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.73ms. Allocated memory is still 197.1MB. Free memory was 164.9MB in the beginning and 166.6MB in the end (delta: -1.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.78ms. Allocated memory is still 197.1MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.13ms. Allocated memory is still 197.1MB. Free memory was 164.5MB in the beginning and 149.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4269.23ms. Allocated memory was 197.1MB in the beginning and 281.0MB in the end (delta: 83.9MB). Free memory was 148.7MB in the beginning and 88.0MB in the end (delta: 60.7MB). Peak memory consumption was 145.7MB. Max. memory is 16.1GB. * Witness Printer took 86.92ms. Allocated memory is still 281.0MB. Free memory was 88.0MB in the beginning and 247.2MB in the end (delta: -159.2MB). Peak memory consumption was 4.2MB. 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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 2 procedures, 37 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 180 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 656 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 50, 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, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 686 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 938 ConstructedInterpolants, 0 QuantifiedInterpolants, 2018 SizeOfPredicates, 2 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 3142/3439 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 10 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((0 <= (idBitLength + 2147483648)) && (material_length <= 2147483647)) && (idBitLength <= 2147483647)) && (j == 0)) || ((((((((((long long) j + 1) >= 0) ? (((long long) j + 1) / 4) : ((((long long) j + 1) / 4) - 1)) == 2147483647) || (((((long long) j + 1) >= 0) ? (((long long) j + 1) / 4) : ((((long long) j + 1) / 4) - 1)) < 2147483647)) && (1 <= j)) && (0 <= (idBitLength + 2147483648))) && (material_length <= 2147483647)) && (idBitLength <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:12:53,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE