./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_04_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_04_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 224d987ceb09cc9f2ec7176f4f478b53aa40ce51119a4d3f86b1650099ef76b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:02:53,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:02:53,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 16:02:53,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:02:53,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:02:53,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:02:53,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:02:53,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:02:53,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:02:53,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:02:53,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:02:53,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:02:53,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:02:53,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:02:53,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:02:53,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:02:53,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:02:53,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:02:53,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:02:53,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:02:53,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:02:53,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:02:53,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:02:53,911 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:02:53,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:02:53,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:02:53,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:02:53,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:02:53,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:02:53,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:02:53,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:02:53,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:02:53,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:02:53,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:02:53,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:02:53,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:02:53,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 16:02:53,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:02:53,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:02:53,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:02:53,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:02:53,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 224d987ceb09cc9f2ec7176f4f478b53aa40ce51119a4d3f86b1650099ef76b1 [2024-10-13 16:02:54,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:02:54,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:02:54,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:02:54,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:02:54,121 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:02:54,122 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_04_good.i [2024-10-13 16:02:55,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:02:55,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:02:55,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_04_good.i [2024-10-13 16:02:55,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadb52917/98c46522fd13444a84df939cc1ac0163/FLAG69fcf0fc3 [2024-10-13 16:02:55,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadb52917/98c46522fd13444a84df939cc1ac0163 [2024-10-13 16:02:55,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:02:55,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:02:55,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:02:55,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:02:55,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:02:55,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:02:55" (1/1) ... [2024-10-13 16:02:55,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7544364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:55, skipping insertion in model container [2024-10-13 16:02:55,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:02:55" (1/1) ... [2024-10-13 16:02:55,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:02:56,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:02:56,128 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:02:56,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:02:56,298 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:02:56,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56 WrapperNode [2024-10-13 16:02:56,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:02:56,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:02:56,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:02:56,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:02:56,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,355 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 211 [2024-10-13 16:02:56,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:02:56,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:02:56,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:02:56,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:02:56,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,382 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:02:56,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:02:56,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:02:56,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:02:56,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:02:56,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (1/1) ... [2024-10-13 16:02:56,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:02:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:02:56,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 16:02:56,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 16:02:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 16:02:56,466 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 16:02:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:02:56,466 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:02:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:02:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:02:56,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:02:56,596 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:02:56,598 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:02:56,832 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-13 16:02:56,832 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:02:56,854 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:02:56,854 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 16:02:56,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:56 BoogieIcfgContainer [2024-10-13 16:02:56,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:02:56,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:02:56,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:02:56,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:02:56,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:02:55" (1/3) ... [2024-10-13 16:02:56,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75802893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:02:56, skipping insertion in model container [2024-10-13 16:02:56,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:02:56" (2/3) ... [2024-10-13 16:02:56,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75802893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:02:56, skipping insertion in model container [2024-10-13 16:02:56,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:56" (3/3) ... [2024-10-13 16:02:56,862 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_04_good.i [2024-10-13 16:02:56,874 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:02:56,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 16:02:56,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:02:56,929 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;@7d6bb52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:02:56,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 16:02:56,943 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-13 16:02:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 16:02:56,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:56,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:56,951 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-13 16:02:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 973150889, now seen corresponding path program 1 times [2024-10-13 16:02:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810427279] [2024-10-13 16:02:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810427279] [2024-10-13 16:02:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810427279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:02:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510110966] [2024-10-13 16:02:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,265 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-13 16:02:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,321 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2024-10-13 16:02:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,323 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-13 16:02:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,328 INFO L225 Difference]: With dead ends: 186 [2024-10-13 16:02:57,328 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 16:02:57,333 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-13 16:02:57,336 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-13 16:02:57,337 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-13 16:02:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 16:02:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 16:02:57,371 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-13 16:02:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-13 16:02:57,373 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 12 [2024-10-13 16:02:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,374 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-13 16:02:57,375 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-13 16:02:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-13 16:02:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 16:02:57,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:57,377 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-13 16:02:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 16:02:57,377 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-13 16:02:57,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash -999340794, now seen corresponding path program 1 times [2024-10-13 16:02:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260123329] [2024-10-13 16:02:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260123329] [2024-10-13 16:02:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260123329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158181817] [2024-10-13 16:02:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,480 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-13 16:02:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,508 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2024-10-13 16:02:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,509 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-13 16:02:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,510 INFO L225 Difference]: With dead ends: 100 [2024-10-13 16:02:57,510 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 16:02:57,510 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-13 16:02:57,511 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-13 16:02:57,511 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-13 16:02:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 16:02:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 16:02:57,520 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-13 16:02:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-13 16:02:57,522 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 18 [2024-10-13 16:02:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,522 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-13 16:02:57,522 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-13 16:02:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-13 16:02:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 16:02:57,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:57,523 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-13 16:02:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 16:02:57,523 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-13 16:02:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -914793396, now seen corresponding path program 1 times [2024-10-13 16:02:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840052958] [2024-10-13 16:02:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840052958] [2024-10-13 16:02:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840052958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888677717] [2024-10-13 16:02:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,585 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-13 16:02:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,610 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2024-10-13 16:02:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,610 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-13 16:02:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,611 INFO L225 Difference]: With dead ends: 99 [2024-10-13 16:02:57,611 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 16:02:57,612 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-13 16:02:57,612 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-13 16:02:57,613 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-13 16:02:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 16:02:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 16:02:57,619 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-13 16:02:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-10-13 16:02:57,621 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 19 [2024-10-13 16:02:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,622 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-10-13 16:02:57,622 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-13 16:02:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-10-13 16:02:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 16:02:57,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:57,623 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-13 16:02:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 16:02:57,623 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-13 16:02:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1726004662, now seen corresponding path program 1 times [2024-10-13 16:02:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170615694] [2024-10-13 16:02:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170615694] [2024-10-13 16:02:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170615694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:57,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185044536] [2024-10-13 16:02:57,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,693 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-13 16:02:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,715 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2024-10-13 16:02:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,716 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-13 16:02:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,718 INFO L225 Difference]: With dead ends: 98 [2024-10-13 16:02:57,718 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 16:02:57,718 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-13 16:02:57,719 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-13 16:02:57,719 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-13 16:02:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 16:02:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-13 16:02:57,729 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-13 16:02:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2024-10-13 16:02:57,729 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 28 [2024-10-13 16:02:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,730 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2024-10-13 16:02:57,730 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-13 16:02:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2024-10-13 16:02:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 16:02:57,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:57,731 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-13 16:02:57,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 16:02:57,731 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-13 16:02:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1966536715, now seen corresponding path program 1 times [2024-10-13 16:02:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140732627] [2024-10-13 16:02:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:57,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140732627] [2024-10-13 16:02:57,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140732627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375769096] [2024-10-13 16:02:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,797 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-13 16:02:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,816 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-10-13 16:02:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,816 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-13 16:02:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,817 INFO L225 Difference]: With dead ends: 97 [2024-10-13 16:02:57,819 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 16:02:57,819 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-13 16:02:57,820 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-13 16:02:57,820 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-13 16:02:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 16:02:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 16:02:57,827 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-13 16:02:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-13 16:02:57,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 29 [2024-10-13 16:02:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,829 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-13 16:02:57,829 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-13 16:02:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-13 16:02:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 16:02:57,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:57,830 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-13 16:02:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 16:02:57,831 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-13 16:02:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 419235195, now seen corresponding path program 1 times [2024-10-13 16:02:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264379077] [2024-10-13 16:02:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264379077] [2024-10-13 16:02:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264379077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969119787] [2024-10-13 16:02:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,881 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-13 16:02:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,895 INFO L93 Difference]: Finished difference Result 96 states and 135 transitions. [2024-10-13 16:02:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,896 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-13 16:02:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,897 INFO L225 Difference]: With dead ends: 96 [2024-10-13 16:02:57,897 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 16:02:57,897 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-13 16:02:57,898 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-13 16:02:57,898 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-13 16:02:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 16:02:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 16:02:57,902 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-13 16:02:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-10-13 16:02:57,903 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 31 [2024-10-13 16:02:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,903 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-10-13 16:02:57,903 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-13 16:02:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-10-13 16:02:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 16:02:57,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:57,904 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-13 16:02:57,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 16:02:57,905 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-13 16:02:57,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 111389444, now seen corresponding path program 1 times [2024-10-13 16:02:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087314166] [2024-10-13 16:02:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087314166] [2024-10-13 16:02:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087314166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025381456] [2024-10-13 16:02:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:57,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:57,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:57,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:57,961 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-13 16:02:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:57,982 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2024-10-13 16:02:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:57,983 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-13 16:02:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:57,983 INFO L225 Difference]: With dead ends: 108 [2024-10-13 16:02:57,983 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 16:02:57,984 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-13 16:02:57,984 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-13 16:02:57,984 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-13 16:02:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 16:02:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 16:02:57,996 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-13 16:02:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-13 16:02:57,997 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 32 [2024-10-13 16:02:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:57,997 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-13 16:02:57,998 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-13 16:02:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-13 16:02:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 16:02:58,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:58,001 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-13 16:02:58,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 16:02:58,001 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-13 16:02:58,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1534074167, now seen corresponding path program 1 times [2024-10-13 16:02:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170033400] [2024-10-13 16:02:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 16:02:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 16:02:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170033400] [2024-10-13 16:02:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170033400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:02:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996769570] [2024-10-13 16:02:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:58,056 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-13 16:02:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:58,068 INFO L93 Difference]: Finished difference Result 154 states and 210 transitions. [2024-10-13 16:02:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:58,068 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-13 16:02:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:58,069 INFO L225 Difference]: With dead ends: 154 [2024-10-13 16:02:58,069 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 16:02:58,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:58,071 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-13 16:02:58,071 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-13 16:02:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 16:02:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 16:02:58,078 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-13 16:02:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2024-10-13 16:02:58,078 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 38 [2024-10-13 16:02:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:58,079 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2024-10-13 16:02:58,079 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-13 16:02:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2024-10-13 16:02:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 16:02:58,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:58,080 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-13 16:02:58,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 16:02:58,080 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-13 16:02:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash -109231555, now seen corresponding path program 1 times [2024-10-13 16:02:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:58,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46081069] [2024-10-13 16:02:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 16:02:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:58,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46081069] [2024-10-13 16:02:58,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46081069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:58,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:58,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661890027] [2024-10-13 16:02:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:58,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:58,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:58,137 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-13 16:02:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:58,152 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2024-10-13 16:02:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:58,152 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-13 16:02:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:58,153 INFO L225 Difference]: With dead ends: 90 [2024-10-13 16:02:58,153 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 16:02:58,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:58,154 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-13 16:02:58,154 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-13 16:02:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 16:02:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 16:02:58,160 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-13 16:02:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-13 16:02:58,160 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 41 [2024-10-13 16:02:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:58,160 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-13 16:02:58,160 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-13 16:02:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-10-13 16:02:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 16:02:58,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:02:58,163 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-13 16:02:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 16:02:58,163 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-13 16:02:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:02:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 908789403, now seen corresponding path program 1 times [2024-10-13 16:02:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:02:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555166546] [2024-10-13 16:02:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:02:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:02:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:02:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 16:02:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:02:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:02:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:02:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555166546] [2024-10-13 16:02:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555166546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:02:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:02:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:02:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522961222] [2024-10-13 16:02:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:02:58,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:02:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:02:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:02:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:58,216 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-13 16:02:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:02:58,228 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-13 16:02:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:02:58,228 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-13 16:02:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:02:58,228 INFO L225 Difference]: With dead ends: 89 [2024-10-13 16:02:58,229 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 16:02:58,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:02:58,230 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-13 16:02:58,231 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-13 16:02:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 16:02:58,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 16:02:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:02:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 16:02:58,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-10-13 16:02:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:02:58,233 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:02:58,233 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-13 16:02:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 16:02:58,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 16:02:58,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 16:02:58,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 16:02:58,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 16:02:58,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 16:02:58,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 16:02:58,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 16:02:58,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 16:02:58,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 16:02:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 16:02:58,241 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:02:58,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 16:02:58,323 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:02:58,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:02:58 BoogieIcfgContainer [2024-10-13 16:02:58,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:02:58,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:02:58,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:02:58,338 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:02:58,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:56" (3/4) ... [2024-10-13 16:02:58,340 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 16:02:58,343 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 16:02:58,343 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 16:02:58,349 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 16:02:58,349 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 16:02:58,349 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 16:02:58,350 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 16:02:58,434 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:02:58,435 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 16:02:58,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:02:58,435 INFO L158 Benchmark]: Toolchain (without parser) took 2879.67ms. Allocated memory is still 184.5MB. Free memory was 113.5MB in the beginning and 73.0MB in the end (delta: 40.5MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,435 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:02:58,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.40ms. Allocated memory is still 184.5MB. Free memory was 113.1MB in the beginning and 117.7MB in the end (delta: -4.6MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.08ms. Allocated memory is still 184.5MB. Free memory was 117.7MB in the beginning and 114.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,436 INFO L158 Benchmark]: Boogie Preprocessor took 42.04ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 111.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,438 INFO L158 Benchmark]: RCFGBuilder took 456.20ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 85.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,439 INFO L158 Benchmark]: TraceAbstraction took 1480.90ms. Allocated memory is still 184.5MB. Free memory was 85.1MB in the beginning and 80.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,439 INFO L158 Benchmark]: Witness Printer took 97.04ms. Allocated memory is still 184.5MB. Free memory was 80.3MB in the beginning and 73.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 16:02:58,440 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.12ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.40ms. Allocated memory is still 184.5MB. Free memory was 113.1MB in the beginning and 117.7MB in the end (delta: -4.6MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.08ms. Allocated memory is still 184.5MB. Free memory was 117.7MB in the beginning and 114.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.04ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 111.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 456.20ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 85.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1480.90ms. Allocated memory is still 184.5MB. Free memory was 85.1MB in the beginning and 80.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 97.04ms. Allocated memory is still 184.5MB. Free memory was 80.3MB in the beginning and 73.0MB in the end (delta: 7.3MB). 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: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1635]: 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.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.1s 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.6s 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: (STATIC_CONST_TRUE == 1) Ensures: (STATIC_CONST_TRUE == 1) - ProcedureContractResult [Line: 1426]: Procedure Contract for printIntLine Derived contract for procedure printIntLine. Requires: (STATIC_CONST_TRUE == 1) Ensures: (STATIC_CONST_TRUE == 1) RESULT: Ultimate proved your program to be correct! [2024-10-13 16:02:58,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE