./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 41b46cae14752bbf818c00843f21a60e8a9ff457c697e732204ac3392d940a5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 15:53:21,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 15:53:21,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 15:53:21,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 15:53:21,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 15:53:21,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 15:53:21,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 15:53:21,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 15:53:21,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 15:53:21,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 15:53:21,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 15:53:21,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 15:53:21,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 15:53:21,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 15:53:21,661 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 15:53:21,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 15:53:21,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 15:53:21,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 15:53:21,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 15:53:21,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 15:53:21,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 15:53:21,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 15:53:21,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 15:53:21,668 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 15:53:21,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 15:53:21,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 15:53:21,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 15:53:21,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 15:53:21,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 15:53:21,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 15:53:21,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 15:53:21,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:53:21,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 15:53:21,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 15:53:21,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 15:53:21,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 15:53:21,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 15:53:21,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 15:53:21,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 15:53:21,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 15:53:21,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 15:53:21,675 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41b46cae14752bbf818c00843f21a60e8a9ff457c697e732204ac3392d940a5c [2024-10-13 15:53:21,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 15:53:21,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 15:53:21,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 15:53:21,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 15:53:21,975 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 15:53:21,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i [2024-10-13 15:53:23,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 15:53:23,668 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 15:53:23,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_15_good.i [2024-10-13 15:53:23,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a66f79d19/f244d08201f94cd29187ab8c5f737e4a/FLAG22829e994 [2024-10-13 15:53:23,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a66f79d19/f244d08201f94cd29187ab8c5f737e4a [2024-10-13 15:53:23,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 15:53:23,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 15:53:23,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 15:53:23,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 15:53:23,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 15:53:23,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:53:23" (1/1) ... [2024-10-13 15:53:23,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4bb544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:23, skipping insertion in model container [2024-10-13 15:53:23,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:53:23" (1/1) ... [2024-10-13 15:53:23,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 15:53:24,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:53:24,703 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 15:53:24,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 15:53:24,944 INFO L204 MainTranslator]: Completed translation [2024-10-13 15:53:24,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24 WrapperNode [2024-10-13 15:53:24,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 15:53:24,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 15:53:24,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 15:53:24,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 15:53:24,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:24,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,010 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 197 [2024-10-13 15:53:25,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 15:53:25,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 15:53:25,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 15:53:25,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 15:53:25,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,055 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 15:53:25,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 15:53:25,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 15:53:25,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 15:53:25,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 15:53:25,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (1/1) ... [2024-10-13 15:53:25,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 15:53:25,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 15:53:25,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 15:53:25,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 15:53:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 15:53:25,164 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 15:53:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 15:53:25,164 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 15:53:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 15:53:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 15:53:25,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 15:53:25,318 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 15:53:25,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 15:53:25,548 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-13 15:53:25,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 15:53:25,581 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 15:53:25,581 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 15:53:25,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:25 BoogieIcfgContainer [2024-10-13 15:53:25,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 15:53:25,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 15:53:25,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 15:53:25,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 15:53:25,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:53:23" (1/3) ... [2024-10-13 15:53:25,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a360f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:53:25, skipping insertion in model container [2024-10-13 15:53:25,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:53:24" (2/3) ... [2024-10-13 15:53:25,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a360f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:53:25, skipping insertion in model container [2024-10-13 15:53:25,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:25" (3/3) ... [2024-10-13 15:53:25,591 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_15_good.i [2024-10-13 15:53:25,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 15:53:25,604 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 15:53:25,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 15:53:25,667 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;@74c97321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 15:53:25,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 15:53:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 63 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 15:53:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 15:53:25,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:25,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:25,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1553384363, now seen corresponding path program 1 times [2024-10-13 15:53:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282765368] [2024-10-13 15:53:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:53:26,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:26,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282765368] [2024-10-13 15:53:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282765368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835562454] [2024-10-13 15:53:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:26,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,046 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 63 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:53:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:26,122 INFO L93 Difference]: Finished difference Result 137 states and 196 transitions. [2024-10-13 15:53:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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 13 [2024-10-13 15:53:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:26,131 INFO L225 Difference]: With dead ends: 137 [2024-10-13 15:53:26,131 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 15:53:26,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,137 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:26,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 15:53:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-13 15:53:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 60 states have internal predecessors, (72), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 15:53:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2024-10-13 15:53:26,192 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 13 [2024-10-13 15:53:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:26,193 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2024-10-13 15:53:26,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:53:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2024-10-13 15:53:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 15:53:26,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:26,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 15:53:26,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash -910274924, now seen corresponding path program 1 times [2024-10-13 15:53:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:26,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955005421] [2024-10-13 15:53:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:53:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955005421] [2024-10-13 15:53:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955005421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:26,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158954519] [2024-10-13 15:53:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:26,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:26,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:26,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,352 INFO L87 Difference]: Start difference. First operand 69 states and 98 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:53:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:26,387 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2024-10-13 15:53:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:26,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-13 15:53:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:26,391 INFO L225 Difference]: With dead ends: 70 [2024-10-13 15:53:26,391 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 15:53:26,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,392 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:26,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 152 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 15:53:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-13 15:53:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 59 states have internal predecessors, (71), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 15:53:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-13 15:53:26,411 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 14 [2024-10-13 15:53:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-13 15:53:26,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:53:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-13 15:53:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 15:53:26,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:26,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:26,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 15:53:26,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1938447375, now seen corresponding path program 1 times [2024-10-13 15:53:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229259601] [2024-10-13 15:53:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:53:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229259601] [2024-10-13 15:53:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229259601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713043714] [2024-10-13 15:53:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:26,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,497 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:53:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:26,527 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2024-10-13 15:53:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-10-13 15:53:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:26,529 INFO L225 Difference]: With dead ends: 115 [2024-10-13 15:53:26,530 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 15:53:26,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,532 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:26,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 15:53:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 15:53:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 59 states have internal predecessors, (69), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 15:53:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-13 15:53:26,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 17 [2024-10-13 15:53:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-13 15:53:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 15:53:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-13 15:53:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 15:53:26,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:26,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 15:53:26,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2018164127, now seen corresponding path program 1 times [2024-10-13 15:53:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:26,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291358300] [2024-10-13 15:53:26,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 15:53:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:53:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291358300] [2024-10-13 15:53:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291358300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:26,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367541647] [2024-10-13 15:53:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,624 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 15:53:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:26,648 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2024-10-13 15:53:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2024-10-13 15:53:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:26,650 INFO L225 Difference]: With dead ends: 115 [2024-10-13 15:53:26,650 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 15:53:26,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,653 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:26,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 15:53:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 15:53:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.425531914893617) internal successors, (67), 58 states have internal predecessors, (67), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 15:53:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2024-10-13 15:53:26,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 21 [2024-10-13 15:53:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:26,669 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2024-10-13 15:53:26,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 15:53:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2024-10-13 15:53:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 15:53:26,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:26,671 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] [2024-10-13 15:53:26,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 15:53:26,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:26,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash -957584524, now seen corresponding path program 1 times [2024-10-13 15:53:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723608934] [2024-10-13 15:53:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:53:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:26,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723608934] [2024-10-13 15:53:26,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723608934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:26,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083049638] [2024-10-13 15:53:26,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:26,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,745 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:53:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:26,782 INFO L93 Difference]: Finished difference Result 105 states and 142 transitions. [2024-10-13 15:53:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2024-10-13 15:53:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:26,805 INFO L225 Difference]: With dead ends: 105 [2024-10-13 15:53:26,805 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 15:53:26,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,806 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:26,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 156 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 15:53:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-10-13 15:53:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 60 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 15:53:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2024-10-13 15:53:26,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 24 [2024-10-13 15:53:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:26,815 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2024-10-13 15:53:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:53:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2024-10-13 15:53:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 15:53:26,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:26,816 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] [2024-10-13 15:53:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 15:53:26,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash 379650937, now seen corresponding path program 1 times [2024-10-13 15:53:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043432777] [2024-10-13 15:53:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:53:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043432777] [2024-10-13 15:53:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043432777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:26,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399842222] [2024-10-13 15:53:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,905 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:53:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:26,940 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-10-13 15:53:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:26,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2024-10-13 15:53:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:26,942 INFO L225 Difference]: With dead ends: 70 [2024-10-13 15:53:26,942 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 15:53:26,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:26,943 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:26,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 141 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 15:53:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-13 15:53:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 59 states have internal predecessors, (69), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 15:53:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-10-13 15:53:26,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 25 [2024-10-13 15:53:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:26,956 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-10-13 15:53:26,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:53:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-10-13 15:53:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 15:53:26,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:26,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:26,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 15:53:26,958 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-13 15:53:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1705145746, now seen corresponding path program 1 times [2024-10-13 15:53:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:26,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376816039] [2024-10-13 15:53:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 15:53:27,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376816039] [2024-10-13 15:53:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376816039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92344345] [2024-10-13 15:53:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,010 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:53:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,030 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2024-10-13 15:53:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 29 [2024-10-13 15:53:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,032 INFO L225 Difference]: With dead ends: 98 [2024-10-13 15:53:27,032 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 15:53:27,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,034 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 15:53:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 15:53:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 57 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 15:53:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-10-13 15:53:27,046 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 29 [2024-10-13 15:53:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,046 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-10-13 15:53:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 15:53:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-10-13 15:53:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 15:53:27,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,047 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] [2024-10-13 15:53:27,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 15:53:27,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 461786935, now seen corresponding path program 1 times [2024-10-13 15:53:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780068047] [2024-10-13 15:53:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:53:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780068047] [2024-10-13 15:53:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780068047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427510473] [2024-10-13 15:53:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,115 INFO L87 Difference]: Start difference. First operand 66 states and 87 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,135 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-10-13 15:53:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,137 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-13 15:53:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,138 INFO L225 Difference]: With dead ends: 67 [2024-10-13 15:53:27,138 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 15:53:27,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,139 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 131 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 15:53:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-13 15:53:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 56 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 15:53:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-10-13 15:53:27,150 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 35 [2024-10-13 15:53:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,150 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-10-13 15:53:27,150 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-10-13 15:53:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 15:53:27,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,151 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] [2024-10-13 15:53:27,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 15:53:27,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1430493245, now seen corresponding path program 1 times [2024-10-13 15:53:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655098751] [2024-10-13 15:53:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:53:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655098751] [2024-10-13 15:53:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655098751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261450213] [2024-10-13 15:53:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,220 INFO L87 Difference]: Start difference. First operand 65 states and 86 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,243 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2024-10-13 15:53:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,244 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-13 15:53:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,245 INFO L225 Difference]: With dead ends: 73 [2024-10-13 15:53:27,245 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 15:53:27,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,246 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 15:53:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-10-13 15:53:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 60 states have internal predecessors, (69), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 15:53:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-10-13 15:53:27,256 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 36 [2024-10-13 15:53:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,257 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-10-13 15:53:27,257 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-10-13 15:53:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 15:53:27,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,258 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] [2024-10-13 15:53:27,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 15:53:27,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1432340287, now seen corresponding path program 1 times [2024-10-13 15:53:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752141078] [2024-10-13 15:53:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:53:27,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752141078] [2024-10-13 15:53:27,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752141078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301134111] [2024-10-13 15:53:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,314 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,331 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2024-10-13 15:53:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-13 15:53:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,333 INFO L225 Difference]: With dead ends: 94 [2024-10-13 15:53:27,334 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 15:53:27,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,335 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 15:53:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 15:53:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 59 states have internal predecessors, (68), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 15:53:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-10-13 15:53:27,346 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 36 [2024-10-13 15:53:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,346 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-10-13 15:53:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-10-13 15:53:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 15:53:27,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:27,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 15:53:27,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 182223378, now seen corresponding path program 1 times [2024-10-13 15:53:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816762698] [2024-10-13 15:53:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 15:53:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 15:53:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816762698] [2024-10-13 15:53:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816762698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697828703] [2024-10-13 15:53:27,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,404 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 15:53:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,426 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2024-10-13 15:53:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-10-13 15:53:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,429 INFO L225 Difference]: With dead ends: 89 [2024-10-13 15:53:27,429 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 15:53:27,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,431 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 15:53:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 15:53:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 15:53:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-10-13 15:53:27,437 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 40 [2024-10-13 15:53:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,437 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-10-13 15:53:27,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 15:53:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-10-13 15:53:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 15:53:27,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:27,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 15:53:27,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 507084035, now seen corresponding path program 1 times [2024-10-13 15:53:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080408064] [2024-10-13 15:53:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 15:53:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080408064] [2024-10-13 15:53:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080408064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603466046] [2024-10-13 15:53:27,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,525 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,540 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2024-10-13 15:53:27,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-13 15:53:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,542 INFO L225 Difference]: With dead ends: 77 [2024-10-13 15:53:27,542 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 15:53:27,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,543 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 15:53:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 15:53:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 15:53:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-10-13 15:53:27,547 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 40 [2024-10-13 15:53:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-10-13 15:53:27,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 15:53:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2024-10-13 15:53:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 15:53:27,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:27,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 15:53:27,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1037124480, now seen corresponding path program 1 times [2024-10-13 15:53:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566834905] [2024-10-13 15:53:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:53:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 15:53:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566834905] [2024-10-13 15:53:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566834905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608955408] [2024-10-13 15:53:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,598 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:53:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,613 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-10-13 15:53:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-13 15:53:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,614 INFO L225 Difference]: With dead ends: 61 [2024-10-13 15:53:27,614 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 15:53:27,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,615 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 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-13 15:53:27,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 15:53:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 15:53:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.1875) internal successors, (57), 51 states have internal predecessors, (57), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 15:53:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-10-13 15:53:27,619 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 45 [2024-10-13 15:53:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,619 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-10-13 15:53:27,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:53:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-10-13 15:53:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 15:53:27,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:27,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 15:53:27,621 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2086087626, now seen corresponding path program 1 times [2024-10-13 15:53:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401123105] [2024-10-13 15:53:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:53:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 15:53:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401123105] [2024-10-13 15:53:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401123105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 15:53:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282272617] [2024-10-13 15:53:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,670 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:53:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,687 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-10-13 15:53:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-10-13 15:53:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,689 INFO L225 Difference]: With dead ends: 65 [2024-10-13 15:53:27,689 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 15:53:27,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,690 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 15:53:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 15:53:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 15:53:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2024-10-13 15:53:27,696 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 46 [2024-10-13 15:53:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,696 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-10-13 15:53:27,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:53:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2024-10-13 15:53:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 15:53:27,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 15:53:27,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 15:53:27,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 15:53:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 15:53:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -188886881, now seen corresponding path program 1 times [2024-10-13 15:53:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 15:53:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414354258] [2024-10-13 15:53:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 15:53:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 15:53:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 15:53:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 15:53:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 15:53:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 15:53:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 15:53:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 15:53:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 15:53:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414354258] [2024-10-13 15:53:27,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414354258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 15:53:27,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 15:53:27,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 15:53:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356592296] [2024-10-13 15:53:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 15:53:27,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 15:53:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 15:53:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 15:53:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,752 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:53:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 15:53:27,763 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2024-10-13 15:53:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 15:53:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-10-13 15:53:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 15:53:27,764 INFO L225 Difference]: With dead ends: 64 [2024-10-13 15:53:27,764 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 15:53:27,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 15:53:27,765 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 15:53:27,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 15:53:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 15:53:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 15:53:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 15:53:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 15:53:27,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-10-13 15:53:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 15:53:27,769 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 15:53:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 15:53:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 15:53:27,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 15:53:27,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 15:53:27,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 15:53:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 15:53:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 15:53:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 15:53:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 15:53:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 15:53:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 15:53:27,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 15:53:27,777 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 15:53:27,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 15:53:27,824 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 15:53:27,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:53:27 BoogieIcfgContainer [2024-10-13 15:53:27,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 15:53:27,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 15:53:27,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 15:53:27,841 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 15:53:27,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:53:25" (3/4) ... [2024-10-13 15:53:27,843 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 15:53:27,847 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 15:53:27,847 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 15:53:27,854 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-13 15:53:27,855 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-13 15:53:27,855 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 15:53:27,856 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:53:27,856 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 15:53:27,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 15:53:27,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 15:53:27,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 15:53:27,953 INFO L158 Benchmark]: Toolchain (without parser) took 4046.26ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 140.7MB in the beginning and 107.9MB in the end (delta: 32.8MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,953 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 15:53:27,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1036.98ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 74.0MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.16ms. Allocated memory is still 174.1MB. Free memory was 74.0MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,954 INFO L158 Benchmark]: Boogie Preprocessor took 55.59ms. Allocated memory is still 174.1MB. Free memory was 71.1MB in the beginning and 140.4MB in the end (delta: -69.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,954 INFO L158 Benchmark]: RCFGBuilder took 514.44ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 140.4MB in the beginning and 159.0MB in the end (delta: -18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,955 INFO L158 Benchmark]: TraceAbstraction took 2256.36ms. Allocated memory is still 209.7MB. Free memory was 158.0MB in the beginning and 114.2MB in the end (delta: 43.7MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,955 INFO L158 Benchmark]: Witness Printer took 111.86ms. Allocated memory is still 209.7MB. Free memory was 114.2MB in the beginning and 107.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 15:53:27,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1036.98ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 74.0MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.16ms. Allocated memory is still 174.1MB. Free memory was 74.0MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.59ms. Allocated memory is still 174.1MB. Free memory was 71.1MB in the beginning and 140.4MB in the end (delta: -69.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 514.44ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 140.4MB in the beginning and 159.0MB in the end (delta: -18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2256.36ms. Allocated memory is still 209.7MB. Free memory was 158.0MB in the beginning and 114.2MB in the end (delta: 43.7MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 111.86ms. Allocated memory is still 209.7MB. Free memory was 114.2MB in the beginning and 107.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 2124 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1020 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1104 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 15 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 50/50 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 RESULT: Ultimate proved your program to be correct! [2024-10-13 15:53:27,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE