./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fc72386314414fabf94e6d82d60679ab07d15db5567c5294668f3d10b3b3054f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:18:36,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:18:36,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:18:36,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:18:36,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:18:36,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:18:36,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:18:36,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:18:36,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:18:36,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:18:36,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:18:36,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:18:36,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:18:36,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:18:36,570 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:18:36,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:18:36,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:18:36,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:18:36,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:18:36,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:18:36,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:18:36,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:18:36,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:18:36,574 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:18:36,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:18:36,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:18:36,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:18:36,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:18:36,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:18:36,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:18:36,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:18:36,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:18:36,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:18:36,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:18:36,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:18:36,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:18:36,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:18:36,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:18:36,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:18:36,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:18:36,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:18:36,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc72386314414fabf94e6d82d60679ab07d15db5567c5294668f3d10b3b3054f [2024-10-11 23:18:36,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:18:36,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:18:36,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:18:36,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:18:36,870 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:18:36,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2024-10-11 23:18:38,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:18:38,666 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:18:38,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2024-10-11 23:18:38,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd4f13dea/2a4c198a1dd646cf8378869274139187/FLAGb690dade7 [2024-10-11 23:18:38,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd4f13dea/2a4c198a1dd646cf8378869274139187 [2024-10-11 23:18:38,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:18:38,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:18:38,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:18:38,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:18:38,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:18:38,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:18:38" (1/1) ... [2024-10-11 23:18:38,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@310825a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:38, skipping insertion in model container [2024-10-11 23:18:38,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:18:38" (1/1) ... [2024-10-11 23:18:38,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:18:39,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:18:39,581 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:18:39,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:18:39,868 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:18:39,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39 WrapperNode [2024-10-11 23:18:39,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:18:39,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:18:39,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:18:39,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:18:39,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,950 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2024-10-11 23:18:39,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:18:39,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:18:39,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:18:39,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:18:39,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,983 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:18:39,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:39,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:40,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:40,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:18:40,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:18:40,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:18:40,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:18:40,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (1/1) ... [2024-10-11 23:18:40,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:18:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:18:40,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:18:40,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:18:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:18:40,106 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:18:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:18:40,106 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:18:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:18:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:18:40,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:18:40,233 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:18:40,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:18:40,609 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 23:18:40,609 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:18:40,637 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:18:40,637 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:18:40,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:18:40 BoogieIcfgContainer [2024-10-11 23:18:40,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:18:40,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:18:40,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:18:40,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:18:40,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:18:38" (1/3) ... [2024-10-11 23:18:40,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a76e048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:18:40, skipping insertion in model container [2024-10-11 23:18:40,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:39" (2/3) ... [2024-10-11 23:18:40,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a76e048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:18:40, skipping insertion in model container [2024-10-11 23:18:40,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:18:40" (3/3) ... [2024-10-11 23:18:40,650 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2024-10-11 23:18:40,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:18:40,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 23:18:40,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:18:40,716 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;@160886ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:18:40,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 23:18:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 85 states have (on average 1.576470588235294) internal successors, (134), 93 states have internal predecessors, (134), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 23:18:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 23:18:40,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:40,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:40,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:40,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 973150889, now seen corresponding path program 1 times [2024-10-11 23:18:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:40,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067213207] [2024-10-11 23:18:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:40,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067213207] [2024-10-11 23:18:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067213207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:18:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431658451] [2024-10-11 23:18:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:41,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:41,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,101 INFO L87 Difference]: Start difference. First operand has 106 states, 85 states have (on average 1.576470588235294) internal successors, (134), 93 states have internal predecessors, (134), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:41,182 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2024-10-11 23:18:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 23:18:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:41,191 INFO L225 Difference]: With dead ends: 186 [2024-10-11 23:18:41,191 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 23:18:41,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,198 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:41,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 23:18:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 23:18:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.5) internal successors, (123), 89 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-11 23:18:41,242 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 12 [2024-10-11 23:18:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:41,246 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-11 23:18:41,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-11 23:18:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 23:18:41,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:41,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:41,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:18:41,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -999340794, now seen corresponding path program 1 times [2024-10-11 23:18:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756505600] [2024-10-11 23:18:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756505600] [2024-10-11 23:18:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756505600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736178502] [2024-10-11 23:18:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,385 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:41,426 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2024-10-11 23:18:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:41,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 23:18:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:41,430 INFO L225 Difference]: With dead ends: 100 [2024-10-11 23:18:41,430 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 23:18:41,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,432 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 36 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:41,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 224 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 23:18:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 23:18:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 88 states have internal predecessors, (122), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-11 23:18:41,455 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 18 [2024-10-11 23:18:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:41,455 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-11 23:18:41,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-11 23:18:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 23:18:41,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:41,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:41,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:18:41,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:41,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash -914793396, now seen corresponding path program 1 times [2024-10-11 23:18:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:41,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48386148] [2024-10-11 23:18:41,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:41,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:41,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48386148] [2024-10-11 23:18:41,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48386148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:41,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:41,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326981688] [2024-10-11 23:18:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:41,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,545 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:41,577 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2024-10-11 23:18:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 23:18:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:41,581 INFO L225 Difference]: With dead ends: 99 [2024-10-11 23:18:41,581 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 23:18:41,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,583 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:41,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 23:18:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 23:18:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.475609756097561) internal successors, (121), 87 states have internal predecessors, (121), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-10-11 23:18:41,595 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 19 [2024-10-11 23:18:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-10-11 23:18:41,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-10-11 23:18:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 23:18:41,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:41,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:41,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:18:41,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:41,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1726004662, now seen corresponding path program 1 times [2024-10-11 23:18:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719849601] [2024-10-11 23:18:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:41,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719849601] [2024-10-11 23:18:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719849601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:41,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790808093] [2024-10-11 23:18:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:41,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,689 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:41,717 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2024-10-11 23:18:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:41,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-11 23:18:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:41,719 INFO L225 Difference]: With dead ends: 98 [2024-10-11 23:18:41,720 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 23:18:41,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,722 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:41,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 220 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 23:18:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 23:18:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 86 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2024-10-11 23:18:41,734 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 28 [2024-10-11 23:18:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2024-10-11 23:18:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2024-10-11 23:18:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 23:18:41,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:41,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:41,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:18:41,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:41,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1966536715, now seen corresponding path program 1 times [2024-10-11 23:18:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:41,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179172917] [2024-10-11 23:18:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:41,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179172917] [2024-10-11 23:18:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179172917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:41,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476209596] [2024-10-11 23:18:41,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:41,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,830 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:41,857 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-10-11 23:18:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 23:18:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:41,859 INFO L225 Difference]: With dead ends: 97 [2024-10-11 23:18:41,859 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 23:18:41,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,861 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:41,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 23:18:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 23:18:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 85 states have internal predecessors, (119), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-11 23:18:41,872 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 29 [2024-10-11 23:18:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:41,872 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-11 23:18:41,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-11 23:18:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 23:18:41,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:41,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:41,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:18:41,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:41,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 419235195, now seen corresponding path program 1 times [2024-10-11 23:18:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613496516] [2024-10-11 23:18:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:41,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:41,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613496516] [2024-10-11 23:18:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613496516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:41,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:41,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:41,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181318261] [2024-10-11 23:18:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:41,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:41,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,946 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:41,970 INFO L93 Difference]: Finished difference Result 96 states and 135 transitions. [2024-10-11 23:18:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-10-11 23:18:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:41,973 INFO L225 Difference]: With dead ends: 96 [2024-10-11 23:18:41,975 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 23:18:41,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:41,976 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:41,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 247 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 23:18:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 23:18:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 84 states have internal predecessors, (118), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-10-11 23:18:41,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 31 [2024-10-11 23:18:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:41,991 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-10-11 23:18:41,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-10-11 23:18:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 23:18:41,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:41,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:41,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:18:41,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 111389444, now seen corresponding path program 1 times [2024-10-11 23:18:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818193344] [2024-10-11 23:18:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818193344] [2024-10-11 23:18:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818193344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:42,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294536042] [2024-10-11 23:18:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:42,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:42,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:42,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:42,086 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:42,112 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2024-10-11 23:18:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:42,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-10-11 23:18:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:42,113 INFO L225 Difference]: With dead ends: 108 [2024-10-11 23:18:42,114 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 23:18:42,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:42,116 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:42,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 23:18:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 23:18:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 88 states have internal predecessors, (122), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:18:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-11 23:18:42,133 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 32 [2024-10-11 23:18:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:42,133 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-11 23:18:42,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:18:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-11 23:18:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 23:18:42,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:42,135 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:42,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:18:42,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:42,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1534074167, now seen corresponding path program 1 times [2024-10-11 23:18:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868567149] [2024-10-11 23:18:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 23:18:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,219 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-11 23:18:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:42,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868567149] [2024-10-11 23:18:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868567149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:18:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433094211] [2024-10-11 23:18:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:42,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:42,222 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:18:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:42,234 INFO L93 Difference]: Finished difference Result 154 states and 210 transitions. [2024-10-11 23:18:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-11 23:18:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:42,236 INFO L225 Difference]: With dead ends: 154 [2024-10-11 23:18:42,237 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 23:18:42,237 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-11 23:18:42,238 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:42,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 23:18:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 23:18:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.4) internal successors, (112), 81 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:18:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2024-10-11 23:18:42,250 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 38 [2024-10-11 23:18:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:42,250 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2024-10-11 23:18:42,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:18:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2024-10-11 23:18:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 23:18:42,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:42,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:42,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:18:42,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -109231555, now seen corresponding path program 1 times [2024-10-11 23:18:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393976291] [2024-10-11 23:18:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:42,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 23:18:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:42,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393976291] [2024-10-11 23:18:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393976291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:42,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414396833] [2024-10-11 23:18:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:42,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:42,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:42,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:42,333 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:18:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:42,349 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2024-10-11 23:18:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 41 [2024-10-11 23:18:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:42,351 INFO L225 Difference]: With dead ends: 90 [2024-10-11 23:18:42,351 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 23:18:42,351 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-11 23:18:42,352 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:42,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 23:18:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 23:18:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:18:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-11 23:18:42,360 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 41 [2024-10-11 23:18:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-11 23:18:42,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:18:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-10-11 23:18:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 23:18:42,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:18:42,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:42,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:18:42,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:18:42,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:18:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash 908789403, now seen corresponding path program 1 times [2024-10-11 23:18:42,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:18:42,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087886894] [2024-10-11 23:18:42,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:18:42,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:18:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:18:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 23:18:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:18:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:18:42,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:18:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087886894] [2024-10-11 23:18:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087886894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:18:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:18:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:18:42,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321587234] [2024-10-11 23:18:42,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:18:42,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:18:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:18:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:18:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:18:42,438 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:18:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:18:42,451 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-11 23:18:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:18:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 42 [2024-10-11 23:18:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:18:42,452 INFO L225 Difference]: With dead ends: 89 [2024-10-11 23:18:42,452 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:18:42,453 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-11 23:18:42,453 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:18:42,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:18:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:18:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:18:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:18:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:18:42,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-10-11 23:18:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:18:42,455 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:18:42,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:18:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:18:42,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:18:42,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 23:18:42,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 23:18:42,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 23:18:42,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 23:18:42,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 23:18:42,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 23:18:42,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 23:18:42,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 23:18:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 23:18:42,467 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:18:42,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:18:42,576 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:18:42,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:18:42 BoogieIcfgContainer [2024-10-11 23:18:42,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:18:42,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:18:42,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:18:42,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:18:42,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:18:40" (3/4) ... [2024-10-11 23:18:42,598 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:18:42,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:18:42,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:18:42,611 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 23:18:42,612 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 23:18:42,612 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:18:42,613 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:18:42,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:18:42,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:18:42,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:18:42,726 INFO L158 Benchmark]: Toolchain (without parser) took 4010.89ms. Allocated memory is still 186.6MB. Free memory was 115.8MB in the beginning and 76.3MB in the end (delta: 39.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-10-11 23:18:42,726 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:18:42,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1150.91ms. Allocated memory is still 186.6MB. Free memory was 115.5MB in the beginning and 116.5MB in the end (delta: -926.4kB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-11 23:18:42,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.98ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 112.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 23:18:42,727 INFO L158 Benchmark]: Boogie Preprocessor took 53.52ms. Allocated memory is still 186.6MB. Free memory was 112.9MB in the beginning and 110.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:18:42,727 INFO L158 Benchmark]: RCFGBuilder took 632.81ms. Allocated memory is still 186.6MB. Free memory was 110.2MB in the beginning and 83.2MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 23:18:42,727 INFO L158 Benchmark]: TraceAbstraction took 1950.31ms. Allocated memory is still 186.6MB. Free memory was 82.9MB in the beginning and 84.7MB in the end (delta: -1.8MB). Peak memory consumption was 299.0kB. Max. memory is 16.1GB. [2024-10-11 23:18:42,727 INFO L158 Benchmark]: Witness Printer took 129.93ms. Allocated memory is still 186.6MB. Free memory was 84.7MB in the beginning and 76.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 23:18:42,728 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.16ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1150.91ms. Allocated memory is still 186.6MB. Free memory was 115.5MB in the beginning and 116.5MB in the end (delta: -926.4kB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.98ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 112.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.52ms. Allocated memory is still 186.6MB. Free memory was 112.9MB in the beginning and 110.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.81ms. Allocated memory is still 186.6MB. Free memory was 110.2MB in the beginning and 83.2MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1950.31ms. Allocated memory is still 186.6MB. Free memory was 82.9MB in the beginning and 84.7MB in the end (delta: -1.8MB). Peak memory consumption was 299.0kB. Max. memory is 16.1GB. * Witness Printer took 129.93ms. Allocated memory is still 186.6MB. Free memory was 84.7MB in the beginning and 76.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 106 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 2178 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 904 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1274 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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 8 specifications checked. All of them hold - ProcedureContractResult [Line: 1412]: Procedure Contract for printLine Derived contract for procedure printLine. Requires: (GLOBAL_CONST_TRUE == 1) Ensures: (GLOBAL_CONST_TRUE == 1) - ProcedureContractResult [Line: 1426]: Procedure Contract for printIntLine Derived contract for procedure printIntLine. Requires: (GLOBAL_CONST_TRUE == 1) Ensures: (GLOBAL_CONST_TRUE == 1) RESULT: Ultimate proved your program to be correct! [2024-10-11 23:18:42,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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