./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 23:10:51,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 23:10:51,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-22 23:10:51,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 23:10:51,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 23:10:51,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 23:10:51,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 23:10:51,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 23:10:51,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 23:10:51,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 23:10:51,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 23:10:51,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 23:10:51,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 23:10:51,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 23:10:51,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 23:10:51,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 23:10:51,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 23:10:51,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 23:10:51,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 23:10:51,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 23:10:51,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 23:10:51,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 23:10:51,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 23:10:51,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 23:10:51,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 23:10:51,469 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 23:10:51,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 23:10:51,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 23:10:51,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 23:10:51,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 23:10:51,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 23:10:51,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 23:10:51,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 23:10:51,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 23:10:51,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:10:51,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 23:10:51,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 23:10:51,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 23:10:51,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 23:10:51,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 23:10:51,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 23:10:51,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 23:10:51,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 23:10:51,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 23:10:51,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2024-11-22 23:10:51,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 23:10:51,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 23:10:51,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 23:10:51,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 23:10:51,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 23:10:51,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2024-11-22 23:10:52,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 23:10:53,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 23:10:53,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2024-11-22 23:10:53,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7648ad5a1/432d93da5fb24a49804f8a1e144f3db0/FLAGe1ca582cf [2024-11-22 23:10:53,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7648ad5a1/432d93da5fb24a49804f8a1e144f3db0 [2024-11-22 23:10:53,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 23:10:53,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 23:10:53,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 23:10:53,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 23:10:53,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 23:10:53,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c7629d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53, skipping insertion in model container [2024-11-22 23:10:53,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 23:10:53,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:10:53,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 23:10:53,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:10:53,449 INFO L204 MainTranslator]: Completed translation [2024-11-22 23:10:53,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53 WrapperNode [2024-11-22 23:10:53,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 23:10:53,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 23:10:53,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 23:10:53,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 23:10:53,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,479 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 224 [2024-11-22 23:10:53,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 23:10:53,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 23:10:53,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 23:10:53,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 23:10:53,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,503 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 23:10:53,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 23:10:53,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 23:10:53,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 23:10:53,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 23:10:53,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (1/1) ... [2024-11-22 23:10:53,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:10:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:10:53,552 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-11-22 23:10:53,557 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-11-22 23:10:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 23:10:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-22 23:10:53,587 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-22 23:10:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-22 23:10:53,587 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-22 23:10:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-22 23:10:53,587 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-22 23:10:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-22 23:10:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-22 23:10:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-22 23:10:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-22 23:10:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 23:10:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-22 23:10:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-22 23:10:53,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 23:10:53,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 23:10:53,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 23:10:53,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 23:10:53,912 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-22 23:10:53,914 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 23:10:53,929 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 23:10:53,929 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 23:10:53,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:10:53 BoogieIcfgContainer [2024-11-22 23:10:53,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 23:10:53,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 23:10:53,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 23:10:53,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 23:10:53,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:10:53" (1/3) ... [2024-11-22 23:10:53,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa0ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:10:53, skipping insertion in model container [2024-11-22 23:10:53,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:53" (2/3) ... [2024-11-22 23:10:53,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa0ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:10:53, skipping insertion in model container [2024-11-22 23:10:53,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:10:53" (3/3) ... [2024-11-22 23:10:53,938 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2024-11-22 23:10:53,951 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 23:10:53,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-22 23:10:54,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 23:10:54,007 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;@5bfc1919, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 23:10:54,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 23:10:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 95 states have internal predecessors, (137), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 23:10:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 23:10:54,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:54,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:54,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:54,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:54,028 INFO L85 PathProgramCache]: Analyzing trace with hash -507947728, now seen corresponding path program 1 times [2024-11-22 23:10:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:54,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309178038] [2024-11-22 23:10:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:54,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:54,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309178038] [2024-11-22 23:10:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309178038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:10:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327730976] [2024-11-22 23:10:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:54,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:10:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:10:54,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:54,418 INFO L87 Difference]: Start difference. First operand has 116 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 95 states have internal predecessors, (137), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:54,708 INFO L93 Difference]: Finished difference Result 330 states and 481 transitions. [2024-11-22 23:10:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 23:10:54,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-22 23:10:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:54,722 INFO L225 Difference]: With dead ends: 330 [2024-11-22 23:10:54,722 INFO L226 Difference]: Without dead ends: 213 [2024-11-22 23:10:54,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:54,729 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 229 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:54,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 426 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:10:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-22 23:10:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 204. [2024-11-22 23:10:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 167 states have internal predecessors, (234), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-22 23:10:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2024-11-22 23:10:54,781 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 55 [2024-11-22 23:10:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:54,781 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2024-11-22 23:10:54,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2024-11-22 23:10:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 23:10:54,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:54,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:54,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 23:10:54,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:54,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1956486444, now seen corresponding path program 1 times [2024-11-22 23:10:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962632895] [2024-11-22 23:10:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962632895] [2024-11-22 23:10:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962632895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:54,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868311546] [2024-11-22 23:10:54,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:54,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:54,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:54,922 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:55,259 INFO L93 Difference]: Finished difference Result 514 states and 718 transitions. [2024-11-22 23:10:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 23:10:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-22 23:10:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:55,262 INFO L225 Difference]: With dead ends: 514 [2024-11-22 23:10:55,264 INFO L226 Difference]: Without dead ends: 319 [2024-11-22 23:10:55,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:10:55,266 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 212 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:55,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 716 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 23:10:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-22 23:10:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2024-11-22 23:10:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.4340425531914893) internal successors, (337), 241 states have internal predecessors, (337), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-22 23:10:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 411 transitions. [2024-11-22 23:10:55,312 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 411 transitions. Word has length 55 [2024-11-22 23:10:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:55,313 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 411 transitions. [2024-11-22 23:10:55,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 411 transitions. [2024-11-22 23:10:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 23:10:55,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:55,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:55,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 23:10:55,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1059093166, now seen corresponding path program 1 times [2024-11-22 23:10:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957431237] [2024-11-22 23:10:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:55,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957431237] [2024-11-22 23:10:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957431237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169326459] [2024-11-22 23:10:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:55,453 INFO L87 Difference]: Start difference. First operand 294 states and 411 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:55,739 INFO L93 Difference]: Finished difference Result 812 states and 1136 transitions. [2024-11-22 23:10:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 23:10:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-22 23:10:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:55,743 INFO L225 Difference]: With dead ends: 812 [2024-11-22 23:10:55,743 INFO L226 Difference]: Without dead ends: 527 [2024-11-22 23:10:55,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:10:55,745 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 251 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:55,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 687 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:10:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-22 23:10:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 471. [2024-11-22 23:10:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 378 states have (on average 1.417989417989418) internal successors, (536), 388 states have internal predecessors, (536), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2024-11-22 23:10:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 658 transitions. [2024-11-22 23:10:55,777 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 658 transitions. Word has length 55 [2024-11-22 23:10:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:55,777 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 658 transitions. [2024-11-22 23:10:55,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 658 transitions. [2024-11-22 23:10:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 23:10:55,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:55,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:55,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 23:10:55,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:55,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1307239660, now seen corresponding path program 1 times [2024-11-22 23:10:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:55,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034028866] [2024-11-22 23:10:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:55,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034028866] [2024-11-22 23:10:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034028866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33689143] [2024-11-22 23:10:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:55,856 INFO L87 Difference]: Start difference. First operand 471 states and 658 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:56,145 INFO L93 Difference]: Finished difference Result 1333 states and 1873 transitions. [2024-11-22 23:10:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 23:10:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-22 23:10:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:56,150 INFO L225 Difference]: With dead ends: 1333 [2024-11-22 23:10:56,151 INFO L226 Difference]: Without dead ends: 871 [2024-11-22 23:10:56,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:10:56,155 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 204 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:56,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 671 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:10:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-22 23:10:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 796. [2024-11-22 23:10:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 635 states have (on average 1.3984251968503938) internal successors, (888), 659 states have internal predecessors, (888), 85 states have call successors, (85), 52 states have call predecessors, (85), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2024-11-22 23:10:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1122 transitions. [2024-11-22 23:10:56,221 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1122 transitions. Word has length 55 [2024-11-22 23:10:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:56,222 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1122 transitions. [2024-11-22 23:10:56,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1122 transitions. [2024-11-22 23:10:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 23:10:56,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:56,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 23:10:56,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1730886382, now seen corresponding path program 1 times [2024-11-22 23:10:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352760439] [2024-11-22 23:10:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352760439] [2024-11-22 23:10:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352760439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:56,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:56,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 23:10:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74057715] [2024-11-22 23:10:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:10:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:10:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:10:56,273 INFO L87 Difference]: Start difference. First operand 796 states and 1122 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:56,411 INFO L93 Difference]: Finished difference Result 2024 states and 2881 transitions. [2024-11-22 23:10:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:10:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-22 23:10:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:56,418 INFO L225 Difference]: With dead ends: 2024 [2024-11-22 23:10:56,418 INFO L226 Difference]: Without dead ends: 1238 [2024-11-22 23:10:56,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:10:56,423 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 247 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:56,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 475 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:10:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-11-22 23:10:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1213. [2024-11-22 23:10:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 967 states have (on average 1.3681489141675285) internal successors, (1323), 1002 states have internal predecessors, (1323), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-22 23:10:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1668 transitions. [2024-11-22 23:10:56,487 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1668 transitions. Word has length 55 [2024-11-22 23:10:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:56,488 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1668 transitions. [2024-11-22 23:10:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1668 transitions. [2024-11-22 23:10:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:10:56,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:56,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 23:10:56,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 546564074, now seen corresponding path program 1 times [2024-11-22 23:10:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521388318] [2024-11-22 23:10:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521388318] [2024-11-22 23:10:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521388318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:56,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:56,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:10:56,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713155993] [2024-11-22 23:10:56,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:10:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:10:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:56,528 INFO L87 Difference]: Start difference. First operand 1213 states and 1668 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:56,596 INFO L93 Difference]: Finished difference Result 2431 states and 3388 transitions. [2024-11-22 23:10:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:10:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-22 23:10:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:56,601 INFO L225 Difference]: With dead ends: 2431 [2024-11-22 23:10:56,601 INFO L226 Difference]: Without dead ends: 1228 [2024-11-22 23:10:56,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:56,604 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:56,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:10:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-22 23:10:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2024-11-22 23:10:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 982 states have (on average 1.3533604887983706) internal successors, (1329), 1017 states have internal predecessors, (1329), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-22 23:10:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1674 transitions. [2024-11-22 23:10:56,660 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1674 transitions. Word has length 56 [2024-11-22 23:10:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:56,660 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1674 transitions. [2024-11-22 23:10:56,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1674 transitions. [2024-11-22 23:10:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:10:56,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:56,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:56,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 23:10:56,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:56,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 474177516, now seen corresponding path program 1 times [2024-11-22 23:10:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146992197] [2024-11-22 23:10:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:56,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146992197] [2024-11-22 23:10:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146992197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:56,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:56,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:10:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727992289] [2024-11-22 23:10:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:56,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:10:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:10:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:56,699 INFO L87 Difference]: Start difference. First operand 1228 states and 1674 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:56,750 INFO L93 Difference]: Finished difference Result 2488 states and 3436 transitions. [2024-11-22 23:10:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:10:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-22 23:10:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:56,756 INFO L225 Difference]: With dead ends: 2488 [2024-11-22 23:10:56,756 INFO L226 Difference]: Without dead ends: 1270 [2024-11-22 23:10:56,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:56,761 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:56,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:10:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-11-22 23:10:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2024-11-22 23:10:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1024 states have (on average 1.3388671875) internal successors, (1371), 1059 states have internal predecessors, (1371), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-22 23:10:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1716 transitions. [2024-11-22 23:10:56,824 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1716 transitions. Word has length 56 [2024-11-22 23:10:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:56,825 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1716 transitions. [2024-11-22 23:10:56,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1716 transitions. [2024-11-22 23:10:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:10:56,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:56,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:56,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 23:10:56,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1897561746, now seen corresponding path program 1 times [2024-11-22 23:10:56,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:56,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353652764] [2024-11-22 23:10:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353652764] [2024-11-22 23:10:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353652764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:56,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397727408] [2024-11-22 23:10:56,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:56,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:56,914 INFO L87 Difference]: Start difference. First operand 1270 states and 1716 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:57,141 INFO L93 Difference]: Finished difference Result 1722 states and 2324 transitions. [2024-11-22 23:10:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 23:10:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-22 23:10:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:57,146 INFO L225 Difference]: With dead ends: 1722 [2024-11-22 23:10:57,146 INFO L226 Difference]: Without dead ends: 967 [2024-11-22 23:10:57,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:10:57,149 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 209 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:57,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 481 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:10:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-22 23:10:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2024-11-22 23:10:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 730 states have (on average 1.3315068493150686) internal successors, (972), 746 states have internal predecessors, (972), 100 states have call successors, (100), 59 states have call predecessors, (100), 67 states have return successors, (119), 99 states have call predecessors, (119), 100 states have call successors, (119) [2024-11-22 23:10:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1191 transitions. [2024-11-22 23:10:57,184 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1191 transitions. Word has length 56 [2024-11-22 23:10:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:57,186 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1191 transitions. [2024-11-22 23:10:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1191 transitions. [2024-11-22 23:10:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:10:57,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:57,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:57,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 23:10:57,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1678707028, now seen corresponding path program 1 times [2024-11-22 23:10:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722826433] [2024-11-22 23:10:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:57,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722826433] [2024-11-22 23:10:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722826433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:57,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:57,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792165401] [2024-11-22 23:10:57,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:57,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:57,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:57,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:57,272 INFO L87 Difference]: Start difference. First operand 901 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:57,567 INFO L93 Difference]: Finished difference Result 1619 states and 2144 transitions. [2024-11-22 23:10:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 23:10:57,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-22 23:10:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:57,572 INFO L225 Difference]: With dead ends: 1619 [2024-11-22 23:10:57,573 INFO L226 Difference]: Without dead ends: 968 [2024-11-22 23:10:57,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:10:57,576 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 210 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:57,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 468 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:10:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-22 23:10:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 890. [2024-11-22 23:10:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 723 states have (on average 1.326417704011065) internal successors, (959), 735 states have internal predecessors, (959), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2024-11-22 23:10:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1166 transitions. [2024-11-22 23:10:57,608 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1166 transitions. Word has length 56 [2024-11-22 23:10:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:57,609 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1166 transitions. [2024-11-22 23:10:57,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1166 transitions. [2024-11-22 23:10:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:10:57,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:57,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:57,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 23:10:57,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1256005202, now seen corresponding path program 1 times [2024-11-22 23:10:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642624654] [2024-11-22 23:10:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642624654] [2024-11-22 23:10:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642624654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399348008] [2024-11-22 23:10:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:57,685 INFO L87 Difference]: Start difference. First operand 890 states and 1166 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:57,934 INFO L93 Difference]: Finished difference Result 1556 states and 2029 transitions. [2024-11-22 23:10:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 23:10:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-22 23:10:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:57,938 INFO L225 Difference]: With dead ends: 1556 [2024-11-22 23:10:57,939 INFO L226 Difference]: Without dead ends: 826 [2024-11-22 23:10:57,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 23:10:57,941 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 184 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:57,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 495 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:10:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-22 23:10:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 776. [2024-11-22 23:10:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 634 states have (on average 1.3217665615141956) internal successors, (838), 644 states have internal predecessors, (838), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2024-11-22 23:10:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1010 transitions. [2024-11-22 23:10:57,977 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1010 transitions. Word has length 56 [2024-11-22 23:10:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1010 transitions. [2024-11-22 23:10:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1010 transitions. [2024-11-22 23:10:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:10:57,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:57,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:57,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 23:10:57,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2073653652, now seen corresponding path program 1 times [2024-11-22 23:10:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738071495] [2024-11-22 23:10:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738071495] [2024-11-22 23:10:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738071495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 23:10:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093853945] [2024-11-22 23:10:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:58,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:10:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:10:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:10:58,010 INFO L87 Difference]: Start difference. First operand 776 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:58,159 INFO L93 Difference]: Finished difference Result 2248 states and 2976 transitions. [2024-11-22 23:10:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:10:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2024-11-22 23:10:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:58,165 INFO L225 Difference]: With dead ends: 2248 [2024-11-22 23:10:58,165 INFO L226 Difference]: Without dead ends: 1483 [2024-11-22 23:10:58,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:58,167 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 183 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:58,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 329 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:10:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-22 23:10:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1475. [2024-11-22 23:10:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1205 states have (on average 1.3095435684647303) internal successors, (1578), 1222 states have internal predecessors, (1578), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2024-11-22 23:10:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1937 transitions. [2024-11-22 23:10:58,218 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1937 transitions. Word has length 56 [2024-11-22 23:10:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:58,218 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1937 transitions. [2024-11-22 23:10:58,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1937 transitions. [2024-11-22 23:10:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 23:10:58,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:58,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:58,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 23:10:58,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:58,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash -929955691, now seen corresponding path program 1 times [2024-11-22 23:10:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235307710] [2024-11-22 23:10:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235307710] [2024-11-22 23:10:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235307710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:10:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898854778] [2024-11-22 23:10:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:10:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:10:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 23:10:58,235 INFO L87 Difference]: Start difference. First operand 1475 states and 1937 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:58,280 INFO L93 Difference]: Finished difference Result 2662 states and 3472 transitions. [2024-11-22 23:10:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:10:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-22 23:10:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:58,285 INFO L225 Difference]: With dead ends: 2662 [2024-11-22 23:10:58,285 INFO L226 Difference]: Without dead ends: 1198 [2024-11-22 23:10:58,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-22 23:10:58,287 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:58,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:10:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-22 23:10:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-11-22 23:10:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 984 states have (on average 1.2977642276422765) internal successors, (1277), 999 states have internal predecessors, (1277), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2024-11-22 23:10:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1551 transitions. [2024-11-22 23:10:58,326 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1551 transitions. Word has length 57 [2024-11-22 23:10:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:58,326 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1551 transitions. [2024-11-22 23:10:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 23:10:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1551 transitions. [2024-11-22 23:10:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-22 23:10:58,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:58,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 23:10:58,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:58,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1685794816, now seen corresponding path program 1 times [2024-11-22 23:10:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747020343] [2024-11-22 23:10:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:10:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747020343] [2024-11-22 23:10:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747020343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:10:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345610314] [2024-11-22 23:10:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:10:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:58,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:10:58,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 23:10:58,345 INFO L87 Difference]: Start difference. First operand 1198 states and 1551 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 23:10:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:58,405 INFO L93 Difference]: Finished difference Result 3175 states and 4124 transitions. [2024-11-22 23:10:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:10:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-11-22 23:10:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:58,413 INFO L225 Difference]: With dead ends: 3175 [2024-11-22 23:10:58,414 INFO L226 Difference]: Without dead ends: 1987 [2024-11-22 23:10:58,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-22 23:10:58,417 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 111 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:58,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 312 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:10:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2024-11-22 23:10:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1957. [2024-11-22 23:10:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1605 states have (on average 1.2785046728971963) internal successors, (2052), 1629 states have internal predecessors, (2052), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2024-11-22 23:10:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2501 transitions. [2024-11-22 23:10:58,498 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2501 transitions. Word has length 58 [2024-11-22 23:10:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:58,498 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 2501 transitions. [2024-11-22 23:10:58,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 23:10:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2501 transitions. [2024-11-22 23:10:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 23:10:58,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:58,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:10:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 23:10:58,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2084904940, now seen corresponding path program 1 times [2024-11-22 23:10:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566016635] [2024-11-22 23:10:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 23:10:58,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:58,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566016635] [2024-11-22 23:10:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566016635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 23:10:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619509527] [2024-11-22 23:10:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:58,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 23:10:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:58,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 23:10:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 23:10:58,546 INFO L87 Difference]: Start difference. First operand 1957 states and 2501 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 23:10:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:58,992 INFO L93 Difference]: Finished difference Result 5803 states and 7482 transitions. [2024-11-22 23:10:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 23:10:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2024-11-22 23:10:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:59,008 INFO L225 Difference]: With dead ends: 5803 [2024-11-22 23:10:59,008 INFO L226 Difference]: Without dead ends: 3857 [2024-11-22 23:10:59,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-22 23:10:59,013 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 526 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:59,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 669 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 23:10:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2024-11-22 23:10:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3750. [2024-11-22 23:10:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3750 states, 3072 states have (on average 1.2610677083333333) internal successors, (3874), 3117 states have internal predecessors, (3874), 384 states have call successors, (384), 258 states have call predecessors, (384), 290 states have return successors, (555), 376 states have call predecessors, (555), 384 states have call successors, (555) [2024-11-22 23:10:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 4813 transitions. [2024-11-22 23:10:59,225 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 4813 transitions. Word has length 77 [2024-11-22 23:10:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:59,227 INFO L471 AbstractCegarLoop]: Abstraction has 3750 states and 4813 transitions. [2024-11-22 23:10:59,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 23:10:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 4813 transitions. [2024-11-22 23:10:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 23:10:59,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:59,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-22 23:10:59,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 23:10:59,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:59,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash 992575416, now seen corresponding path program 1 times [2024-11-22 23:10:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:59,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218337644] [2024-11-22 23:10:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 23:10:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218337644] [2024-11-22 23:10:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218337644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 23:10:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750528766] [2024-11-22 23:10:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:59,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:10:59,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:10:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:10:59,294 INFO L87 Difference]: Start difference. First operand 3750 states and 4813 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-22 23:10:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:59,555 INFO L93 Difference]: Finished difference Result 6829 states and 8714 transitions. [2024-11-22 23:10:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:10:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-11-22 23:10:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:59,571 INFO L225 Difference]: With dead ends: 6829 [2024-11-22 23:10:59,571 INFO L226 Difference]: Without dead ends: 3853 [2024-11-22 23:10:59,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:10:59,579 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 161 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:59,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 308 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:10:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2024-11-22 23:10:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3806. [2024-11-22 23:10:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3100 states have (on average 1.2496774193548388) internal successors, (3874), 3165 states have internal predecessors, (3874), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2024-11-22 23:10:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4789 transitions. [2024-11-22 23:10:59,768 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4789 transitions. Word has length 91 [2024-11-22 23:10:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:10:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 4789 transitions. [2024-11-22 23:10:59,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-22 23:10:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4789 transitions. [2024-11-22 23:10:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 23:10:59,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:10:59,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-22 23:10:59,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 23:10:59,770 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:10:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:10:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1977535686, now seen corresponding path program 1 times [2024-11-22 23:10:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:10:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640844082] [2024-11-22 23:10:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:10:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:10:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:10:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-22 23:10:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:10:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640844082] [2024-11-22 23:10:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640844082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:10:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:10:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:10:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707769201] [2024-11-22 23:10:59,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:10:59,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:10:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:10:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:10:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 23:10:59,794 INFO L87 Difference]: Start difference. First operand 3806 states and 4789 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 23:10:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:10:59,909 INFO L93 Difference]: Finished difference Result 3808 states and 4789 transitions. [2024-11-22 23:10:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:10:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2024-11-22 23:10:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:10:59,920 INFO L225 Difference]: With dead ends: 3808 [2024-11-22 23:10:59,920 INFO L226 Difference]: Without dead ends: 3070 [2024-11-22 23:10:59,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-22 23:10:59,922 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:10:59,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 147 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:10:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2024-11-22 23:11:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 3070. [2024-11-22 23:11:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2505 states have (on average 1.255489021956088) internal successors, (3145), 2560 states have internal predecessors, (3145), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2024-11-22 23:11:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3879 transitions. [2024-11-22 23:11:00,083 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3879 transitions. Word has length 91 [2024-11-22 23:11:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:00,083 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3879 transitions. [2024-11-22 23:11:00,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 23:11:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3879 transitions. [2024-11-22 23:11:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 23:11:00,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:00,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:00,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 23:11:00,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:11:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1540260944, now seen corresponding path program 1 times [2024-11-22 23:11:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642800696] [2024-11-22 23:11:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 23:11:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642800696] [2024-11-22 23:11:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642800696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 23:11:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483395448] [2024-11-22 23:11:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 23:11:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 23:11:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 23:11:00,159 INFO L87 Difference]: Start difference. First operand 3070 states and 3879 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-22 23:11:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:00,774 INFO L93 Difference]: Finished difference Result 5130 states and 6542 transitions. [2024-11-22 23:11:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 23:11:00,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-22 23:11:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:00,789 INFO L225 Difference]: With dead ends: 5130 [2024-11-22 23:11:00,789 INFO L226 Difference]: Without dead ends: 3152 [2024-11-22 23:11:00,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-22 23:11:00,796 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 876 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:00,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 756 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 23:11:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2024-11-22 23:11:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3070. [2024-11-22 23:11:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2505 states have (on average 1.2467065868263474) internal successors, (3123), 2560 states have internal predecessors, (3123), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-11-22 23:11:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3824 transitions. [2024-11-22 23:11:00,980 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3824 transitions. Word has length 93 [2024-11-22 23:11:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:00,981 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3824 transitions. [2024-11-22 23:11:00,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-22 23:11:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3824 transitions. [2024-11-22 23:11:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-22 23:11:00,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:00,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:00,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 23:11:00,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:11:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash 432140425, now seen corresponding path program 1 times [2024-11-22 23:11:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982026995] [2024-11-22 23:11:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 23:11:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982026995] [2024-11-22 23:11:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982026995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 23:11:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610840759] [2024-11-22 23:11:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:01,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:11:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:01,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:11:01,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 23:11:01,022 INFO L87 Difference]: Start difference. First operand 3070 states and 3824 transitions. Second operand has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-22 23:11:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:01,170 INFO L93 Difference]: Finished difference Result 3070 states and 3824 transitions. [2024-11-22 23:11:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:11:01,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2024-11-22 23:11:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:01,186 INFO L225 Difference]: With dead ends: 3070 [2024-11-22 23:11:01,187 INFO L226 Difference]: Without dead ends: 3069 [2024-11-22 23:11:01,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-22 23:11:01,188 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:01,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:11:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2024-11-22 23:11:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 3069. [2024-11-22 23:11:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2505 states have (on average 1.2431137724550898) internal successors, (3114), 2559 states have internal predecessors, (3114), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-11-22 23:11:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 3815 transitions. [2024-11-22 23:11:01,380 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 3815 transitions. Word has length 100 [2024-11-22 23:11:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:01,380 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 3815 transitions. [2024-11-22 23:11:01,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-22 23:11:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 3815 transitions. [2024-11-22 23:11:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-22 23:11:01,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:01,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:01,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 23:11:01,382 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:11:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 511451573, now seen corresponding path program 1 times [2024-11-22 23:11:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395264276] [2024-11-22 23:11:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:11:01,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 23:11:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:11:01,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 23:11:01,422 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 23:11:01,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-22 23:11:01,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-22 23:11:01,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-22 23:11:01,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-22 23:11:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 23:11:01,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:01,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 23:11:01,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:11:01 BoogieIcfgContainer [2024-11-22 23:11:01,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 23:11:01,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 23:11:01,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 23:11:01,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 23:11:01,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:10:53" (3/4) ... [2024-11-22 23:11:01,499 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 23:11:01,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 23:11:01,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 23:11:01,558 INFO L158 Benchmark]: Toolchain (without parser) took 8399.40ms. Allocated memory was 184.5MB in the beginning and 648.0MB in the end (delta: 463.5MB). Free memory was 128.8MB in the beginning and 509.3MB in the end (delta: -380.5MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,558 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 184.5MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:11:01,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.30ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 113.1MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 111.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,559 INFO L158 Benchmark]: Boogie Preprocessor took 39.15ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 108.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,559 INFO L158 Benchmark]: RCFGBuilder took 410.03ms. Allocated memory is still 184.5MB. Free memory was 108.5MB in the beginning and 88.2MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,559 INFO L158 Benchmark]: TraceAbstraction took 7565.96ms. Allocated memory was 184.5MB in the beginning and 648.0MB in the end (delta: 463.5MB). Free memory was 87.9MB in the beginning and 518.7MB in the end (delta: -430.9MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,559 INFO L158 Benchmark]: Witness Printer took 60.28ms. Allocated memory is still 648.0MB. Free memory was 518.7MB in the beginning and 509.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 23:11:01,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80ms. Allocated memory is still 184.5MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.30ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 113.1MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 111.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.15ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 108.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.03ms. Allocated memory is still 184.5MB. Free memory was 108.5MB in the beginning and 88.2MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7565.96ms. Allocated memory was 184.5MB in the beginning and 648.0MB in the end (delta: 463.5MB). Free memory was 87.9MB in the beginning and 518.7MB in the end (delta: -430.9MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Witness Printer took 60.28ms. Allocated memory is still 648.0MB. Free memory was 518.7MB in the beginning and 509.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L341] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 116 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4121 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4025 mSDsluCounter, 8395 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5574 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3440 IncrementalHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 2821 mSDtfsCounter, 3440 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3806occurred in iteration=15, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 658 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 121/121 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-22 23:11:01,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)