./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/CWE190_Integer_Overflow__int_rand_multiply_04_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_04_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46827e6ca06f4cb7d690cf5c9783929f4958c547bccc01e6762e9848bc66f9f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:32:04,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:32:04,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:32:04,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:32:04,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:32:04,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:32:04,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:32:04,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:32:04,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:32:04,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:32:04,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:32:04,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:32:04,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:32:04,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:32:04,909 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:32:04,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:32:04,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:32:04,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:32:04,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:32:04,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:32:04,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:32:04,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:32:04,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:32:04,916 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:32:04,919 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:32:04,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:32:04,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:32:04,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:32:04,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:32:04,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:32:04,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:32:04,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:32:04,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:32:04,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:32:04,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:32:04,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:32:04,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:32:04,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:32:04,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:32:04,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:32:04,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:32:04,945 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46827e6ca06f4cb7d690cf5c9783929f4958c547bccc01e6762e9848bc66f9f6 [2024-10-11 22:32:05,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:32:05,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:32:05,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:32:05,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:32:05,303 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:32:05,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_04_good.i [2024-10-11 22:32:06,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:32:06,923 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:32:06,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_04_good.i [2024-10-11 22:32:06,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/943bdf901/cd75ba5db31d44cf8e0ad47141d4ba87/FLAG1d64f857d [2024-10-11 22:32:06,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/943bdf901/cd75ba5db31d44cf8e0ad47141d4ba87 [2024-10-11 22:32:06,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:32:06,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:32:06,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:32:06,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:32:06,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:32:06,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:32:06" (1/1) ... [2024-10-11 22:32:06,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173affca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:06, skipping insertion in model container [2024-10-11 22:32:06,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:32:06" (1/1) ... [2024-10-11 22:32:07,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:32:07,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:32:07,536 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:32:07,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:32:07,658 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:32:07,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07 WrapperNode [2024-10-11 22:32:07,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:32:07,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:32:07,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:32:07,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:32:07,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,727 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 211 [2024-10-11 22:32:07,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:32:07,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:32:07,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:32:07,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:32:07,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,757 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:32:07,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:32:07,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:32:07,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:32:07,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:32:07,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (1/1) ... [2024-10-11 22:32:07,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:32:07,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:32:07,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:32:07,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:32:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:32:07,899 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:32:07,903 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:32:07,903 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:32:07,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:32:07,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:32:07,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:32:08,053 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:32:08,055 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:32:08,315 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 22:32:08,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:32:08,354 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:32:08,355 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:32:08,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:32:08 BoogieIcfgContainer [2024-10-11 22:32:08,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:32:08,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:32:08,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:32:08,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:32:08,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:32:06" (1/3) ... [2024-10-11 22:32:08,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9cf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:32:08, skipping insertion in model container [2024-10-11 22:32:08,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:32:07" (2/3) ... [2024-10-11 22:32:08,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9cf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:32:08, skipping insertion in model container [2024-10-11 22:32:08,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:32:08" (3/3) ... [2024-10-11 22:32:08,369 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_04_good.i [2024-10-11 22:32:08,393 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:32:08,393 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:32:08,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:32:08,460 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;@3c3c6d9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:32:08,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:32:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 85 states have (on average 1.576470588235294) internal successors, (134), 93 states have internal predecessors, (134), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 22:32:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:32:08,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:08,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:08,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash 973150889, now seen corresponding path program 1 times [2024-10-11 22:32:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:08,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212049504] [2024-10-11 22:32:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212049504] [2024-10-11 22:32:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212049504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:08,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:32:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690398254] [2024-10-11 22:32:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:08,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:08,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:08,829 INFO L87 Difference]: Start difference. First operand has 106 states, 85 states have (on average 1.576470588235294) internal successors, (134), 93 states have internal predecessors, (134), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:08,884 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2024-10-11 22:32:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:32:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:08,897 INFO L225 Difference]: With dead ends: 186 [2024-10-11 22:32:08,897 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 22:32:08,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:08,904 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:08,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 22:32:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 22:32:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.5) internal successors, (123), 89 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:32:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-11 22:32:08,945 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 12 [2024-10-11 22:32:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:08,947 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-11 22:32:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-11 22:32:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 22:32:08,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:08,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:08,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:32:08,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash -999340794, now seen corresponding path program 1 times [2024-10-11 22:32:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887472020] [2024-10-11 22:32:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887472020] [2024-10-11 22:32:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887472020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:32:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740083348] [2024-10-11 22:32:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:09,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:09,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,085 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:09,115 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2024-10-11 22:32:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:09,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 22:32:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:09,122 INFO L225 Difference]: With dead ends: 100 [2024-10-11 22:32:09,122 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 22:32:09,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,123 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:09,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 22:32:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 22:32:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 88 states have internal predecessors, (122), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:32:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-11 22:32:09,140 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 18 [2024-10-11 22:32:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:09,140 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-11 22:32:09,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-11 22:32:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 22:32:09,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:09,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:09,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:32:09,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:09,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash -914793396, now seen corresponding path program 1 times [2024-10-11 22:32:09,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:09,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752882918] [2024-10-11 22:32:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:09,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:09,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752882918] [2024-10-11 22:32:09,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752882918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:09,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:09,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:32:09,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122890499] [2024-10-11 22:32:09,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:09,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,291 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:09,345 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2024-10-11 22:32:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:09,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 22:32:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:09,351 INFO L225 Difference]: With dead ends: 99 [2024-10-11 22:32:09,351 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 22:32:09,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,353 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:09,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 224 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 22:32:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 22:32:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.475609756097561) internal successors, (121), 87 states have internal predecessors, (121), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:32:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-10-11 22:32:09,371 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 19 [2024-10-11 22:32:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:09,373 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-10-11 22:32:09,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-10-11 22:32:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 22:32:09,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:09,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:09,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:32:09,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:09,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1726004662, now seen corresponding path program 1 times [2024-10-11 22:32:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420869039] [2024-10-11 22:32:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420869039] [2024-10-11 22:32:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420869039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:32:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480652561] [2024-10-11 22:32:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:09,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,497 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:09,516 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2024-10-11 22:32:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-11 22:32:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:09,517 INFO L225 Difference]: With dead ends: 98 [2024-10-11 22:32:09,517 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 22:32:09,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,518 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:09,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 253 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 22:32:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 22:32:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 86 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:32:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2024-10-11 22:32:09,525 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 28 [2024-10-11 22:32:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2024-10-11 22:32:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2024-10-11 22:32:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 22:32:09,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:09,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:09,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:32:09,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1966536715, now seen corresponding path program 1 times [2024-10-11 22:32:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286478354] [2024-10-11 22:32:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:09,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:09,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286478354] [2024-10-11 22:32:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286478354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:09,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:09,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:32:09,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291529512] [2024-10-11 22:32:09,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:09,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:09,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,700 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:09,718 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-10-11 22:32:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:09,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 22:32:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:09,719 INFO L225 Difference]: With dead ends: 97 [2024-10-11 22:32:09,719 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 22:32:09,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,720 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 35 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:09,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 220 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 22:32:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 22:32:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 85 states have internal predecessors, (119), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:32:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-11 22:32:09,727 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 29 [2024-10-11 22:32:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:09,727 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-11 22:32:09,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-11 22:32:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 22:32:09,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:09,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:32:09,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 419235195, now seen corresponding path program 1 times [2024-10-11 22:32:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968431497] [2024-10-11 22:32:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968431497] [2024-10-11 22:32:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968431497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:09,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:32:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885834302] [2024-10-11 22:32:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:09,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,773 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:09,795 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2024-10-11 22:32:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:09,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-10-11 22:32:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:09,798 INFO L225 Difference]: With dead ends: 110 [2024-10-11 22:32:09,798 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 22:32:09,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,799 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:09,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 254 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 22:32:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 22:32:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 89 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:32:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-11 22:32:09,818 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 31 [2024-10-11 22:32:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:09,818 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-11 22:32:09,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:32:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-11 22:32:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 22:32:09,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:09,825 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] [2024-10-11 22:32:09,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:32:09,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:09,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1434959594, now seen corresponding path program 1 times [2024-10-11 22:32:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:09,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802595090] [2024-10-11 22:32:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 22:32:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:32:09,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802595090] [2024-10-11 22:32:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802595090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:09,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:32:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803757295] [2024-10-11 22:32:09,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,938 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:32:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:09,956 INFO L93 Difference]: Finished difference Result 155 states and 211 transitions. [2024-10-11 22:32:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 37 [2024-10-11 22:32:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:09,961 INFO L225 Difference]: With dead ends: 155 [2024-10-11 22:32:09,961 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 22:32:09,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:09,962 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:09,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 22:32:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 22:32:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.4) internal successors, (112), 81 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:32:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2024-10-11 22:32:09,979 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 37 [2024-10-11 22:32:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2024-10-11 22:32:09,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:32:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2024-10-11 22:32:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 22:32:09,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:32:09,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:09,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:32:09,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:32:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:32:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -109231555, now seen corresponding path program 1 times [2024-10-11 22:32:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:32:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607948748] [2024-10-11 22:32:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:32:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:32:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:32:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:10,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 22:32:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:32:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:32:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:32:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607948748] [2024-10-11 22:32:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607948748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:32:10,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:32:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:32:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550135550] [2024-10-11 22:32:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:32:10,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:32:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:32:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:32:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:10,100 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:32:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:32:10,120 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2024-10-11 22:32:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:32:10,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-10-11 22:32:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:32:10,125 INFO L225 Difference]: With dead ends: 90 [2024-10-11 22:32:10,125 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:32:10,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:32:10,126 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:32:10,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:32:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:32:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:32:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:32:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:32:10,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-10-11 22:32:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:32:10,127 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:32:10,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:32:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:32:10,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:32:10,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:32:10,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:32:10,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:32:10,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:32:10,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:32:10,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:32:10,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:32:10,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:32:10,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:32:10,146 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:32:10,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:32:10,314 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:32:10,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:32:10 BoogieIcfgContainer [2024-10-11 22:32:10,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:32:10,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:32:10,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:32:10,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:32:10,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:32:08" (3/4) ... [2024-10-11 22:32:10,355 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:32:10,362 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:32:10,362 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:32:10,372 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 22:32:10,377 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 22:32:10,378 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:32:10,378 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:32:10,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:32:10,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:32:10,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:32:10,554 INFO L158 Benchmark]: Toolchain (without parser) took 3590.00ms. Allocated memory is still 192.9MB. Free memory was 110.9MB in the beginning and 74.1MB in the end (delta: 36.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,554 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:32:10,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.43ms. Allocated memory is still 192.9MB. Free memory was 110.6MB in the beginning and 108.9MB in the end (delta: 1.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.95ms. Allocated memory is still 192.9MB. Free memory was 108.9MB in the beginning and 105.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,554 INFO L158 Benchmark]: Boogie Preprocessor took 47.38ms. Allocated memory is still 192.9MB. Free memory was 104.8MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,555 INFO L158 Benchmark]: RCFGBuilder took 575.63ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 135.2MB in the end (delta: -32.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,555 INFO L158 Benchmark]: TraceAbstraction took 1993.69ms. Allocated memory is still 192.9MB. Free memory was 134.1MB in the beginning and 81.4MB in the end (delta: 52.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,555 INFO L158 Benchmark]: Witness Printer took 202.47ms. Allocated memory is still 192.9MB. Free memory was 81.4MB in the beginning and 74.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:32:10,560 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.14ms. Allocated memory is still 192.9MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.43ms. Allocated memory is still 192.9MB. Free memory was 110.6MB in the beginning and 108.9MB in the end (delta: 1.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.95ms. Allocated memory is still 192.9MB. Free memory was 108.9MB in the beginning and 105.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.38ms. Allocated memory is still 192.9MB. Free memory was 104.8MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.63ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 135.2MB in the end (delta: -32.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1993.69ms. Allocated memory is still 192.9MB. Free memory was 134.1MB in the beginning and 81.4MB in the end (delta: 52.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 202.47ms. Allocated memory is still 192.9MB. Free memory was 81.4MB in the beginning and 74.1MB 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.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 1699 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 669 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1030 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-11 22:32:10,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE