./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.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 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:12:10,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:12:10,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:12:10,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:12:10,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:12:10,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:12:10,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:12:10,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:12:10,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:12:10,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:12:10,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:12:10,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:12:10,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:12:10,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:12:10,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:12:10,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:12:10,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:12:10,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:12:10,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:12:10,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:12:10,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:12:10,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:12:10,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:12:10,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:12:10,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:12:10,424 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:12:10,425 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:12:10,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:12:10,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:12:10,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:12:10,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:12:10,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:12:10,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:12:10,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:12:10,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:12:10,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:12:10,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:12:10,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:12:10,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:12:10,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:12:10,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:12:10,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:12:10,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:12:10,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:12:10,430 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 -> 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 [2024-10-14 21:12:10,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:12:10,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:12:10,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:12:10,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:12:10,696 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:12:10,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2024-10-14 21:12:12,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:12:12,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:12:12,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2024-10-14 21:12:12,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784a6682c/ce264ff5b73c496796e1b07e69f5fab5/FLAG7ed369fd0 [2024-10-14 21:12:12,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784a6682c/ce264ff5b73c496796e1b07e69f5fab5 [2024-10-14 21:12:12,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:12:12,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:12:12,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:12:12,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:12:12,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:12:12,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c61c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12, skipping insertion in model container [2024-10-14 21:12:12,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:12:12,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:12:12,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:12:12,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:12:12,556 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:12:12,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12 WrapperNode [2024-10-14 21:12:12,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:12:12,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:12:12,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:12:12,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:12:12,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,586 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2024-10-14 21:12:12,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:12:12,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:12:12,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:12:12,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:12:12,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,613 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-10-14 21:12:12,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:12:12,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:12:12,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:12:12,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:12:12,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (1/1) ... [2024-10-14 21:12:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:12:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:12,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:12:12,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:12:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:12:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:12:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:12:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:12:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-10-14 21:12:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-10-14 21:12:12,764 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:12:12,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:12:12,881 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-14 21:12:12,881 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:12:12,915 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:12:12,915 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 21:12:12,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:12:12 BoogieIcfgContainer [2024-10-14 21:12:12,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:12:12,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:12:12,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:12:12,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:12:12,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:12:12" (1/3) ... [2024-10-14 21:12:12,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ce2e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:12:12, skipping insertion in model container [2024-10-14 21:12:12,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:12:12" (2/3) ... [2024-10-14 21:12:12,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ce2e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:12:12, skipping insertion in model container [2024-10-14 21:12:12,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:12:12" (3/3) ... [2024-10-14 21:12:12,926 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2024-10-14 21:12:12,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:12:12,945 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 21:12:13,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:12:13,013 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;@becb476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:12:13,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 21:12:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:12:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 21:12:13,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:13,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 21:12:13,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:13,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 63799541, now seen corresponding path program 1 times [2024-10-14 21:12:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:13,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494031729] [2024-10-14 21:12:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494031729] [2024-10-14 21:12:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494031729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:13,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:12:13,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:12:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109006415] [2024-10-14 21:12:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:13,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:12:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:12:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:12:13,285 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:13,364 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-10-14 21:12:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:12:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 21:12:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:13,372 INFO L225 Difference]: With dead ends: 40 [2024-10-14 21:12:13,372 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 21:12:13,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-10-14 21:12:13,377 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:13,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 52 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 21:12:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-14 21:12:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:12:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-14 21:12:13,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 5 [2024-10-14 21:12:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:13,409 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-14 21:12:13,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-14 21:12:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 21:12:13,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:13,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:12:13,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:12:13,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:13,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1708859346, now seen corresponding path program 1 times [2024-10-14 21:12:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:13,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22369991] [2024-10-14 21:12:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22369991] [2024-10-14 21:12:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22369991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592254717] [2024-10-14 21:12:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:13,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:13,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:13,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:12:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:13,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:12:13,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:13,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:13,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592254717] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:13,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:13,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-14 21:12:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893940469] [2024-10-14 21:12:13,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:13,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 21:12:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 21:12:13,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:12:13,818 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:14,061 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-10-14 21:12:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:12:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 21:12:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:14,066 INFO L225 Difference]: With dead ends: 79 [2024-10-14 21:12:14,066 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:12:14,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-14 21:12:14,069 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:14,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 111 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:12:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2024-10-14 21:12:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 43 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:12:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2024-10-14 21:12:14,089 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 10 [2024-10-14 21:12:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:14,089 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2024-10-14 21:12:14,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2024-10-14 21:12:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 21:12:14,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:14,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:12:14,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:14,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:14,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:14,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1435032229, now seen corresponding path program 1 times [2024-10-14 21:12:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050249236] [2024-10-14 21:12:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:14,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050249236] [2024-10-14 21:12:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050249236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691690186] [2024-10-14 21:12:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:14,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:14,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:14,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:12:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:14,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:12:14,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:14,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:12:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691690186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:12:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-10-14 21:12:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20626026] [2024-10-14 21:12:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:12:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:12:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:12:14,511 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:14,588 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-10-14 21:12:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:12:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 21:12:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:14,590 INFO L225 Difference]: With dead ends: 62 [2024-10-14 21:12:14,592 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 21:12:14,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:12:14,594 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:14,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 21:12:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2024-10-14 21:12:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.325) internal successors, (53), 42 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:12:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-10-14 21:12:14,608 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 11 [2024-10-14 21:12:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:14,608 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-10-14 21:12:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-10-14 21:12:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 21:12:14,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:14,611 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:12:14,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:14,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-14 21:12:14,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1465280389, now seen corresponding path program 1 times [2024-10-14 21:12:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549818357] [2024-10-14 21:12:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 21:12:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 21:12:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549818357] [2024-10-14 21:12:14,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549818357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:14,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:12:14,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:12:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464002328] [2024-10-14 21:12:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:14,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:12:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:14,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:12:14,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:12:14,924 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:12:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:14,955 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-10-14 21:12:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:12:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-14 21:12:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:14,957 INFO L225 Difference]: With dead ends: 73 [2024-10-14 21:12:14,958 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:12:14,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-14 21:12:14,959 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:14,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:12:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 21:12:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 21:12:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-10-14 21:12:14,979 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 18 [2024-10-14 21:12:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:14,980 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-10-14 21:12:14,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:12:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-10-14 21:12:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 21:12:14,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:14,981 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:12:14,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:12:14,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:14,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2013219646, now seen corresponding path program 1 times [2024-10-14 21:12:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:14,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898703840] [2024-10-14 21:12:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:15,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:12:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:15,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:12:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898703840] [2024-10-14 21:12:15,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898703840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:12:15,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:12:15,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:12:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648573640] [2024-10-14 21:12:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:12:15,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:12:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:12:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:12:15,040 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:12:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:15,060 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-10-14 21:12:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:12:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 21:12:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:15,062 INFO L225 Difference]: With dead ends: 71 [2024-10-14 21:12:15,062 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 21:12:15,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:12:15,063 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:15,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:12:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 21:12:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 21:12:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 21:12:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-10-14 21:12:15,086 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 23 [2024-10-14 21:12:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:15,087 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-10-14 21:12:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:12:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-10-14 21:12:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 21:12:15,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:15,089 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1] [2024-10-14 21:12:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:12:15,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:15,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1685904693, now seen corresponding path program 2 times [2024-10-14 21:12:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423105653] [2024-10-14 21:12:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423105653] [2024-10-14 21:12:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423105653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890682202] [2024-10-14 21:12:15,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:12:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:15,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:15,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:12:15,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:12:15,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:15,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:12:15,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:15,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890682202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:15,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-10-14 21:12:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634078630] [2024-10-14 21:12:15,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:12:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:12:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:12:15,656 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 27 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 15 states have internal predecessors, (45), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:15,989 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2024-10-14 21:12:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 21:12:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 15 states have internal predecessors, (45), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-14 21:12:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:15,991 INFO L225 Difference]: With dead ends: 187 [2024-10-14 21:12:15,991 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 21:12:15,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 21:12:15,993 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 264 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:15,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 219 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:12:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 21:12:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2024-10-14 21:12:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 115 states have internal predecessors, (132), 12 states have call successors, (12), 11 states have call predecessors, (12), 16 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-14 21:12:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2024-10-14 21:12:16,008 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 25 [2024-10-14 21:12:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:16,009 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2024-10-14 21:12:16,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 15 states have internal predecessors, (45), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2024-10-14 21:12:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 21:12:16,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:16,010 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:12:16,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:16,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:16,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:16,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:16,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1776865054, now seen corresponding path program 1 times [2024-10-14 21:12:16,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:16,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880175236] [2024-10-14 21:12:16,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:16,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 21:12:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:12:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:16,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880175236] [2024-10-14 21:12:16,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880175236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:16,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086070981] [2024-10-14 21:12:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:16,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:16,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:16,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:12:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:16,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 21:12:16,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 21:12:16,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:12:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086070981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:17,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:17,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 30 [2024-10-14 21:12:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71993380] [2024-10-14 21:12:17,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:17,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 21:12:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:17,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 21:12:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2024-10-14 21:12:17,025 INFO L87 Difference]: Start difference. First operand 145 states and 162 transitions. Second operand has 30 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 22 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:12:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:17,458 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2024-10-14 21:12:17,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 21:12:17,459 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 22 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2024-10-14 21:12:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:17,461 INFO L225 Difference]: With dead ends: 207 [2024-10-14 21:12:17,461 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 21:12:17,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 21:12:17,463 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 179 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:17,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 350 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:12:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 21:12:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-10-14 21:12:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 105 states have internal predecessors, (118), 12 states have call successors, (12), 11 states have call predecessors, (12), 13 states have return successors, (16), 16 states have call predecessors, (16), 11 states have call successors, (16) [2024-10-14 21:12:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2024-10-14 21:12:17,490 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 39 [2024-10-14 21:12:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:17,490 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2024-10-14 21:12:17,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 22 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 21:12:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2024-10-14 21:12:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 21:12:17,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:17,492 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1] [2024-10-14 21:12:17,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:17,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:17,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:17,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2091957141, now seen corresponding path program 3 times [2024-10-14 21:12:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:17,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276987029] [2024-10-14 21:12:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:18,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276987029] [2024-10-14 21:12:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276987029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384749327] [2024-10-14 21:12:18,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:12:18,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:18,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:18,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:18,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 21:12:18,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 21:12:18,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:18,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 21:12:18,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:18,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:18,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384749327] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:18,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:18,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 49 [2024-10-14 21:12:18,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85680389] [2024-10-14 21:12:18,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:18,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-14 21:12:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-14 21:12:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=1942, Unknown=0, NotChecked=0, Total=2550 [2024-10-14 21:12:18,910 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 51 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 27 states have internal predecessors, (93), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:19,694 INFO L93 Difference]: Finished difference Result 437 states and 469 transitions. [2024-10-14 21:12:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-14 21:12:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 27 states have internal predecessors, (93), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 21:12:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:19,697 INFO L225 Difference]: With dead ends: 437 [2024-10-14 21:12:19,697 INFO L226 Difference]: Without dead ends: 385 [2024-10-14 21:12:19,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1391, Invalid=3865, Unknown=0, NotChecked=0, Total=5256 [2024-10-14 21:12:19,701 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 599 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:19,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 501 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:12:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-14 21:12:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 363. [2024-10-14 21:12:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 290 states have (on average 1.1206896551724137) internal successors, (325), 289 states have internal predecessors, (325), 24 states have call successors, (24), 23 states have call predecessors, (24), 47 states have return successors, (50), 50 states have call predecessors, (50), 23 states have call successors, (50) [2024-10-14 21:12:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 399 transitions. [2024-10-14 21:12:19,727 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 399 transitions. Word has length 55 [2024-10-14 21:12:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 399 transitions. [2024-10-14 21:12:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 27 states have internal predecessors, (93), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 399 transitions. [2024-10-14 21:12:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 21:12:19,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:19,729 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-10-14 21:12:19,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:19,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash -543530731, now seen corresponding path program 2 times [2024-10-14 21:12:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285735653] [2024-10-14 21:12:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 21:12:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 299 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 21:12:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285735653] [2024-10-14 21:12:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285735653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303430833] [2024-10-14 21:12:20,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:12:20,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:20,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:20,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:20,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:12:20,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:12:20,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:20,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 21:12:20,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 297 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 21:12:20,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 303 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 21:12:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303430833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:21,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 27] total 41 [2024-10-14 21:12:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191536022] [2024-10-14 21:12:21,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:21,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 21:12:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 21:12:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1336, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 21:12:21,268 INFO L87 Difference]: Start difference. First operand 363 states and 399 transitions. Second operand has 41 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 27 states have internal predecessors, (89), 20 states have call successors, (21), 14 states have call predecessors, (21), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-14 21:12:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:21,681 INFO L93 Difference]: Finished difference Result 456 states and 491 transitions. [2024-10-14 21:12:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 21:12:21,682 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 27 states have internal predecessors, (89), 20 states have call successors, (21), 14 states have call predecessors, (21), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 74 [2024-10-14 21:12:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:21,684 INFO L225 Difference]: With dead ends: 456 [2024-10-14 21:12:21,684 INFO L226 Difference]: Without dead ends: 355 [2024-10-14 21:12:21,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 121 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=644, Invalid=2326, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:12:21,686 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 241 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:21,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 743 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:12:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-14 21:12:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 323. [2024-10-14 21:12:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.12015503875969) internal successors, (289), 257 states have internal predecessors, (289), 24 states have call successors, (24), 23 states have call predecessors, (24), 39 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) [2024-10-14 21:12:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 355 transitions. [2024-10-14 21:12:21,709 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 355 transitions. Word has length 74 [2024-10-14 21:12:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:21,709 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 355 transitions. [2024-10-14 21:12:21,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 27 states have internal predecessors, (89), 20 states have call successors, (21), 14 states have call predecessors, (21), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-14 21:12:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 355 transitions. [2024-10-14 21:12:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 21:12:21,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:21,711 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-10-14 21:12:21,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:12:21,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:21,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1729932501, now seen corresponding path program 3 times [2024-10-14 21:12:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334748264] [2024-10-14 21:12:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 21:12:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-14 21:12:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334748264] [2024-10-14 21:12:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334748264] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465483522] [2024-10-14 21:12:22,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:12:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:22,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:22,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:12:22,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 21:12:22,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:22,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:12:22,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-14 21:12:22,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-14 21:12:22,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465483522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:22,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:22,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-14 21:12:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776495141] [2024-10-14 21:12:22,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:22,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 21:12:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 21:12:22,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 21:12:22,357 INFO L87 Difference]: Start difference. First operand 323 states and 355 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 21:12:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:22,512 INFO L93 Difference]: Finished difference Result 566 states and 651 transitions. [2024-10-14 21:12:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 21:12:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2024-10-14 21:12:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:22,516 INFO L225 Difference]: With dead ends: 566 [2024-10-14 21:12:22,516 INFO L226 Difference]: Without dead ends: 565 [2024-10-14 21:12:22,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-10-14 21:12:22,519 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:22,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 25 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-14 21:12:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-10-14 21:12:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 454 states have (on average 1.0682819383259912) internal successors, (485), 449 states have internal predecessors, (485), 24 states have call successors, (24), 23 states have call predecessors, (24), 85 states have return successors, (92), 92 states have call predecessors, (92), 23 states have call successors, (92) [2024-10-14 21:12:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 601 transitions. [2024-10-14 21:12:22,561 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 601 transitions. Word has length 94 [2024-10-14 21:12:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:22,562 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 601 transitions. [2024-10-14 21:12:22,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 21:12:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 601 transitions. [2024-10-14 21:12:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 21:12:22,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:22,566 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1] [2024-10-14 21:12:22,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:12:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:22,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:22,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 764821589, now seen corresponding path program 4 times [2024-10-14 21:12:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301059716] [2024-10-14 21:12:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301059716] [2024-10-14 21:12:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301059716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213429781] [2024-10-14 21:12:23,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 21:12:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:23,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:23,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:12:23,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 21:12:23,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:23,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 21:12:23,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:24,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:12:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213429781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:25,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 97 [2024-10-14 21:12:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275538345] [2024-10-14 21:12:25,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:25,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2024-10-14 21:12:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2024-10-14 21:12:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=7342, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 21:12:25,896 INFO L87 Difference]: Start difference. First operand 565 states and 601 transitions. Second operand has 99 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 51 states have internal predecessors, (189), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:26,463 INFO L93 Difference]: Finished difference Result 580 states and 601 transitions. [2024-10-14 21:12:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-14 21:12:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 51 states have internal predecessors, (189), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-14 21:12:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:26,466 INFO L225 Difference]: With dead ends: 580 [2024-10-14 21:12:26,467 INFO L226 Difference]: Without dead ends: 579 [2024-10-14 21:12:26,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3827, Invalid=9513, Unknown=0, NotChecked=0, Total=13340 [2024-10-14 21:12:26,471 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 440 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:26,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 568 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:12:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-14 21:12:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 564. [2024-10-14 21:12:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 454 states have (on average 1.066079295154185) internal successors, (484), 448 states have internal predecessors, (484), 24 states have call successors, (24), 23 states have call predecessors, (24), 85 states have return successors, (92), 92 states have call predecessors, (92), 23 states have call successors, (92) [2024-10-14 21:12:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 600 transitions. [2024-10-14 21:12:26,502 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 600 transitions. Word has length 115 [2024-10-14 21:12:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 600 transitions. [2024-10-14 21:12:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 51 states have internal predecessors, (189), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 600 transitions. [2024-10-14 21:12:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 21:12:26,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:26,506 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 7, 7, 7, 7, 6, 1, 1, 1, 1] [2024-10-14 21:12:26,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:26,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 21:12:26,710 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:26,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1224465131, now seen corresponding path program 4 times [2024-10-14 21:12:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228907423] [2024-10-14 21:12:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 21:12:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 15 proven. 105 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-14 21:12:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228907423] [2024-10-14 21:12:27,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228907423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562357230] [2024-10-14 21:12:27,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 21:12:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:27,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:27,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:12:27,237 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 21:12:27,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:27,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 21:12:27,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-14 21:12:27,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-14 21:12:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562357230] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:28,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:28,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2024-10-14 21:12:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618790711] [2024-10-14 21:12:28,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:28,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 21:12:28,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:28,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 21:12:28,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 21:12:28,457 INFO L87 Difference]: Start difference. First operand 564 states and 600 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 21:12:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:28,776 INFO L93 Difference]: Finished difference Result 1289 states and 1480 transitions. [2024-10-14 21:12:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 21:12:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-14 21:12:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:28,781 INFO L225 Difference]: With dead ends: 1289 [2024-10-14 21:12:28,781 INFO L226 Difference]: Without dead ends: 1288 [2024-10-14 21:12:28,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=720, Invalid=2820, Unknown=0, NotChecked=0, Total=3540 [2024-10-14 21:12:28,783 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:28,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 45 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-14 21:12:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2024-10-14 21:12:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1038 states have (on average 1.0289017341040463) internal successors, (1068), 1024 states have internal predecessors, (1068), 24 states have call successors, (24), 23 states have call predecessors, (24), 225 states have return successors, (240), 240 states have call predecessors, (240), 23 states have call successors, (240) [2024-10-14 21:12:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1332 transitions. [2024-10-14 21:12:28,844 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1332 transitions. Word has length 114 [2024-10-14 21:12:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:28,845 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1332 transitions. [2024-10-14 21:12:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 21:12:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1332 transitions. [2024-10-14 21:12:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 21:12:28,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:28,847 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1] [2024-10-14 21:12:28,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 21:12:29,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:29,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:29,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1071068565, now seen corresponding path program 5 times [2024-10-14 21:12:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:29,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225563685] [2024-10-14 21:12:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:12:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:29,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 15 proven. 525 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-14 21:12:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225563685] [2024-10-14 21:12:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225563685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789617586] [2024-10-14 21:12:30,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 21:12:30,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:30,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:30,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:12:30,919 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-10-14 21:12:30,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:30,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 21:12:30,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-14 21:12:31,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-10-14 21:12:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789617586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:41,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 64 [2024-10-14 21:12:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313294029] [2024-10-14 21:12:41,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:41,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-14 21:12:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:41,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-14 21:12:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2024-10-14 21:12:41,957 INFO L87 Difference]: Start difference. First operand 1288 states and 1332 transitions. Second operand has 65 states, 64 states have (on average 2.078125) internal successors, (133), 65 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 21:12:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:42,825 INFO L93 Difference]: Finished difference Result 3097 states and 3508 transitions. [2024-10-14 21:12:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-14 21:12:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.078125) internal successors, (133), 65 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) Word has length 154 [2024-10-14 21:12:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:42,832 INFO L225 Difference]: With dead ends: 3097 [2024-10-14 21:12:42,832 INFO L226 Difference]: Without dead ends: 1494 [2024-10-14 21:12:42,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6317 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2976, Invalid=12276, Unknown=0, NotChecked=0, Total=15252 [2024-10-14 21:12:42,841 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 127 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:42,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:12:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-10-14 21:12:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2024-10-14 21:12:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1207 states have (on average 1.0190555095277547) internal successors, (1230), 1186 states have internal predecessors, (1230), 24 states have call successors, (24), 23 states have call predecessors, (24), 262 states have return successors, (284), 284 states have call predecessors, (284), 23 states have call successors, (284) [2024-10-14 21:12:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1538 transitions. [2024-10-14 21:12:42,931 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1538 transitions. Word has length 154 [2024-10-14 21:12:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:42,931 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1538 transitions. [2024-10-14 21:12:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.078125) internal successors, (133), 65 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 21:12:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1538 transitions. [2024-10-14 21:12:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-14 21:12:42,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:12:42,946 INFO L215 NwaCegarLoop]: trace histogram [55, 54, 54, 54, 54, 31, 31, 31, 31, 30, 1, 1, 1, 1] [2024-10-14 21:12:42,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:12:43,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 21:12:43,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 21:12:43,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:12:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash -530932168, now seen corresponding path program 6 times [2024-10-14 21:12:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:12:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113734647] [2024-10-14 21:12:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:12:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:12:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 21:12:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:46,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:46,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:12:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:12:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 54 proven. 2325 refuted. 0 times theorem prover too weak. 7209 trivial. 0 not checked. [2024-10-14 21:12:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:12:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113734647] [2024-10-14 21:12:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113734647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:12:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903781007] [2024-10-14 21:12:51,823 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 21:12:51,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:12:51,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:12:51,827 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:12:51,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:12:52,230 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2024-10-14 21:12:52,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:12:52,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-14 21:12:52,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:12:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 3003 proven. 555 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2024-10-14 21:12:53,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:12:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9588 backedges. 751 proven. 4203 refuted. 0 times theorem prover too weak. 4634 trivial. 0 not checked. [2024-10-14 21:12:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903781007] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:12:54,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:12:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 34, 35] total 98 [2024-10-14 21:12:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327568529] [2024-10-14 21:12:54,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:12:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2024-10-14 21:12:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:12:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2024-10-14 21:12:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=8382, Unknown=0, NotChecked=0, Total=9506 [2024-10-14 21:12:54,728 INFO L87 Difference]: Start difference. First operand 1494 states and 1538 transitions. Second operand has 98 states, 97 states have (on average 2.154639175257732) internal successors, (209), 82 states have internal predecessors, (209), 18 states have call successors, (20), 18 states have call predecessors, (20), 33 states have return successors, (34), 33 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-14 21:12:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:12:56,010 INFO L93 Difference]: Finished difference Result 1494 states and 1538 transitions. [2024-10-14 21:12:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-14 21:12:56,010 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 97 states have (on average 2.154639175257732) internal successors, (209), 82 states have internal predecessors, (209), 18 states have call successors, (20), 18 states have call predecessors, (20), 33 states have return successors, (34), 33 states have call predecessors, (34), 2 states have call successors, (34) Word has length 429 [2024-10-14 21:12:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:12:56,012 INFO L225 Difference]: With dead ends: 1494 [2024-10-14 21:12:56,012 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:12:56,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4021 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1204, Invalid=11678, Unknown=0, NotChecked=0, Total=12882 [2024-10-14 21:12:56,017 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 3344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:12:56,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 44 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3344 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 21:12:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:12:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:12:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:12:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:12:56,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 429 [2024-10-14 21:12:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:12:56,019 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:12:56,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 97 states have (on average 2.154639175257732) internal successors, (209), 82 states have internal predecessors, (209), 18 states have call successors, (20), 18 states have call predecessors, (20), 33 states have return successors, (34), 33 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-14 21:12:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:12:56,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:12:56,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 21:12:56,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 21:12:56,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 21:12:56,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 21:12:56,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:12:56,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 21:12:56,229 INFO L407 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1, 1, 1] [2024-10-14 21:12:56,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:12:58,544 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:12:58,586 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 21:12:58,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:12:58 BoogieIcfgContainer [2024-10-14 21:12:58,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:12:58,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:12:58,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:12:58,589 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:12:58,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:12:12" (3/4) ... [2024-10-14 21:12:58,591 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:12:58,598 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-10-14 21:12:58,602 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 21:12:58,602 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 21:12:58,603 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:12:58,603 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:12:58,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:12:58,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:12:58,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:12:58,679 INFO L158 Benchmark]: Toolchain (without parser) took 46332.20ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 118.9MB in the beginning and 495.3MB in the end (delta: -376.3MB). Peak memory consumption was 540.9MB. Max. memory is 16.1GB. [2024-10-14 21:12:58,680 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:12:58,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.55ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 107.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:12:58,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.03ms. Allocated memory is still 176.2MB. Free memory was 107.7MB in the beginning and 106.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:12:58,681 INFO L158 Benchmark]: Boogie Preprocessor took 31.55ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 105.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:12:58,681 INFO L158 Benchmark]: RCFGBuilder took 295.62ms. Allocated memory is still 176.2MB. Free memory was 105.0MB in the beginning and 94.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:12:58,682 INFO L158 Benchmark]: TraceAbstraction took 45668.99ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 93.8MB in the beginning and 499.5MB in the end (delta: -405.7MB). Peak memory consumption was 612.2MB. Max. memory is 16.1GB. [2024-10-14 21:12:58,682 INFO L158 Benchmark]: Witness Printer took 90.70ms. Allocated memory is still 1.1GB. Free memory was 499.5MB in the beginning and 495.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:12:58,684 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.86ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.55ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 107.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.03ms. Allocated memory is still 176.2MB. Free memory was 107.7MB in the beginning and 106.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.55ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 105.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.62ms. Allocated memory is still 176.2MB. Free memory was 105.0MB in the beginning and 94.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45668.99ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 93.8MB in the beginning and 499.5MB in the end (delta: -405.7MB). Peak memory consumption was 612.2MB. Max. memory is 16.1GB. * Witness Printer took 90.70ms. Allocated memory is still 1.1GB. Free memory was 499.5MB in the beginning and 495.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 14, TraceHistogramMax: 55, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2295 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2231 mSDsluCounter, 2806 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2451 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5508 IncrementalHoareTripleChecker+Invalid, 5762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 355 mSDtfsCounter, 5508 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2781 GetRequests, 2100 SyntacticMatches, 17 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17980 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1494occurred in iteration=13, InterpolantAutomatonStates: 340, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 114 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 2286 NumberOfCodeBlocks, 2201 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 3360 ConstructedInterpolants, 0 QuantifiedInterpolants, 7196 SizeOfPredicates, 75 NumberOfNonLiveVariables, 2115 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 35 InterpolantComputations, 4 PerfectInterpolantSequences, 26808/41418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id. Requires: ((x == 15) || ((x <= 14) && (0 <= x))) Ensures: (((\result == 0) || (x != 0)) && ((x == 15) || ((x <= 14) && (0 <= x)))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:12:58,714 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 Result: TRUE