./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.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/nla-digbench-scaling/dijkstra-u_unwindbound50.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 2616f51a0d79e0bd682803708141b0dc94462ecdbaee78ea9cc6b43878e4310d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:36:36,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:36:36,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:36:36,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:36:36,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:36:36,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:36:36,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:36:36,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:36:36,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:36:36,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:36:36,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:36:36,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:36:36,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:36:36,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:36:36,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:36:36,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:36:36,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:36:36,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:36:36,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:36:36,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:36:36,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:36:36,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:36:36,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:36:36,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:36:36,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:36:36,433 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:36:36,433 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:36:36,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:36:36,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:36:36,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:36:36,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:36:36,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:36:36,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:36:36,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:36:36,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:36:36,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:36:36,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:36:36,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:36:36,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:36:36,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:36:36,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:36:36,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:36:36,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:36:36,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:36:36,438 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 -> 2616f51a0d79e0bd682803708141b0dc94462ecdbaee78ea9cc6b43878e4310d [2024-10-14 20:36:36,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:36:36,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:36:36,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:36:36,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:36:36,781 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:36:36,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2024-10-14 20:36:38,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:36:38,378 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:36:38,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2024-10-14 20:36:38,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8ff3a12/fe5dafbcfb574f29992f87b37a85f5b7/FLAGcc41cce00 [2024-10-14 20:36:38,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8ff3a12/fe5dafbcfb574f29992f87b37a85f5b7 [2024-10-14 20:36:38,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:36:38,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:36:38,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:36:38,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:36:38,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:36:38,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:36:38" (1/1) ... [2024-10-14 20:36:38,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dfb747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:38, skipping insertion in model container [2024-10-14 20:36:38,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:36:38" (1/1) ... [2024-10-14 20:36:38,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:36:38,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:36:38,999 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:36:39,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:36:39,056 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:36:39,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39 WrapperNode [2024-10-14 20:36:39,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:36:39,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:36:39,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:36:39,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:36:39,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,103 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-14 20:36:39,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:36:39,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:36:39,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:36:39,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:36:39,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,131 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 20:36:39,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:36:39,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:36:39,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:36:39,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:36:39,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (1/1) ... [2024-10-14 20:36:39,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:36:39,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:39,176 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 20:36:39,178 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 20:36:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:36:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:36:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:36:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:36:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:36:39,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:36:39,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:36:39,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:36:39,642 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 20:36:39,642 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:36:39,672 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:36:39,672 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:36:39,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:39 BoogieIcfgContainer [2024-10-14 20:36:39,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:36:39,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:36:39,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:36:39,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:36:39,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:36:38" (1/3) ... [2024-10-14 20:36:39,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37668807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:39, skipping insertion in model container [2024-10-14 20:36:39,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:39" (2/3) ... [2024-10-14 20:36:39,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37668807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:39, skipping insertion in model container [2024-10-14 20:36:39,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:39" (3/3) ... [2024-10-14 20:36:39,685 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2024-10-14 20:36:39,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:36:39,702 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 20:36:39,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:36:39,774 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;@57fb26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:36:39,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 20:36:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:36:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:36:39,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:39,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:36:39,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:39,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 123909867, now seen corresponding path program 1 times [2024-10-14 20:36:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754786640] [2024-10-14 20:36:39,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:39,926 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 20:36:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754786640] [2024-10-14 20:36:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754786640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:39,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:36:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069663841] [2024-10-14 20:36:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:39,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:36:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:36:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:36:39,965 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 20:36:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:40,000 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2024-10-14 20:36:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:36:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2024-10-14 20:36:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:40,010 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:36:40,010 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 20:36:40,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:36:40,018 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:40,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 20:36:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 20:36:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 20:36:40,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2024-10-14 20:36:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:40,055 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 20:36:40,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 20:36:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 20:36:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:36:40,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:40,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:36:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:36:40,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 123969449, now seen corresponding path program 1 times [2024-10-14 20:36:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111238694] [2024-10-14 20:36:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:40,186 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 20:36:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111238694] [2024-10-14 20:36:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111238694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:40,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:40,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:36:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851647329] [2024-10-14 20:36:40,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:40,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:36:40,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:40,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:36:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:36:40,191 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 20:36:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:40,262 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-14 20:36:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2024-10-14 20:36:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:40,265 INFO L225 Difference]: With dead ends: 52 [2024-10-14 20:36:40,265 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 20:36:40,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:36:40,268 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:40,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 20:36:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 20:36:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-14 20:36:40,279 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 5 [2024-10-14 20:36:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:40,279 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-14 20:36:40,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 20:36:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-14 20:36:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:36:40,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:40,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:36:40,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1809310676, now seen corresponding path program 1 times [2024-10-14 20:36:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:40,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688197414] [2024-10-14 20:36:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:40,457 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 20:36:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:40,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688197414] [2024-10-14 20:36:40,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688197414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:40,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:40,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559821077] [2024-10-14 20:36:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:40,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:40,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:40,463 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 20:36:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:40,734 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-14 20:36:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:36:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) Word has length 10 [2024-10-14 20:36:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:40,737 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:36:40,737 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:36:40,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:40,738 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:40,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:36:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:36:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-14 20:36:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-14 20:36:40,759 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 10 [2024-10-14 20:36:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:40,759 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-14 20:36:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 20:36:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-14 20:36:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:36:40,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:40,760 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:40,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:36:40,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1809309426, now seen corresponding path program 1 times [2024-10-14 20:36:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799363725] [2024-10-14 20:36:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799363725] [2024-10-14 20:36:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799363725] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848218781] [2024-10-14 20:36:40,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:40,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:40,917 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 20:36:40,919 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 20:36:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:40,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:40,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:41,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848218781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 20:36:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751552544] [2024-10-14 20:36:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:36:41,064 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 20:36:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:41,106 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-10-14 20:36:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:36:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2024-10-14 20:36:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:41,113 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:36:41,113 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 20:36:41,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:36:41,114 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:41,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 20:36:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-14 20:36:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-14 20:36:41,133 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 10 [2024-10-14 20:36:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:41,134 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-14 20:36:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 20:36:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-14 20:36:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:36:41,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:41,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:41,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:36:41,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:41,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:41,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash -254056039, now seen corresponding path program 1 times [2024-10-14 20:36:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:41,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306680618] [2024-10-14 20:36:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:41,413 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 20:36:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:41,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306680618] [2024-10-14 20:36:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306680618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856254413] [2024-10-14 20:36:41,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:41,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:41,421 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 20:36:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:41,555 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-14 20:36:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:36:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) Word has length 11 [2024-10-14 20:36:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:41,557 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:36:41,559 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 20:36:41,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:41,560 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:41,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 20:36:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-14 20:36:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-10-14 20:36:41,573 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 11 [2024-10-14 20:36:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:41,574 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-10-14 20:36:41,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 20:36:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-10-14 20:36:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:36:41,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:41,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:36:41,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -254017310, now seen corresponding path program 1 times [2024-10-14 20:36:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491656882] [2024-10-14 20:36:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:41,694 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 20:36:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491656882] [2024-10-14 20:36:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491656882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971427046] [2024-10-14 20:36:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:41,700 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 20:36:41,701 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 20:36:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:41,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:41,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:41,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971427046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 20:36:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692887144] [2024-10-14 20:36:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:36:41,779 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 20:36:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:41,844 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-14 20:36:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2024-10-14 20:36:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:41,846 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:36:41,846 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:36:41,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:36:41,848 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:41,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:36:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-14 20:36:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-14 20:36:41,857 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2024-10-14 20:36:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:41,858 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-14 20:36:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 20:36:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-14 20:36:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:36:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:41,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:41,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:36:42,060 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,SelfDestructingSolverStorable5 [2024-10-14 20:36:42,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:42,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 302744435, now seen corresponding path program 1 times [2024-10-14 20:36:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506664338] [2024-10-14 20:36:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:42,161 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 20:36:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:42,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506664338] [2024-10-14 20:36:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506664338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:42,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190289553] [2024-10-14 20:36:42,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:42,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:42,165 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 20:36:42,167 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 20:36:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:42,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:36:42,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:42,237 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 20:36:42,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:42,287 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 20:36:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190289553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:42,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:42,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-14 20:36:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847283076] [2024-10-14 20:36:42,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 20:36:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 20:36:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:36:42,290 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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 20:36:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:42,411 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-10-14 20:36:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:36:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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) Word has length 14 [2024-10-14 20:36:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:42,415 INFO L225 Difference]: With dead ends: 92 [2024-10-14 20:36:42,416 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 20:36:42,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-14 20:36:42,417 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:42,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 20:36:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-14 20:36:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-10-14 20:36:42,430 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 14 [2024-10-14 20:36:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:42,431 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-10-14 20:36:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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 20:36:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-10-14 20:36:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:36:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:42,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:42,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:36:42,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:42,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:42,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash 795193831, now seen corresponding path program 1 times [2024-10-14 20:36:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:42,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795666430] [2024-10-14 20:36:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795666430] [2024-10-14 20:36:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795666430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752415720] [2024-10-14 20:36:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:42,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:42,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:42,747 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 20:36:42,749 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 20:36:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:42,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:36:42,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:42,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752415720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-14 20:36:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236761424] [2024-10-14 20:36:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:42,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:36:42,865 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 20:36:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:42,955 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-14 20:36:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:42,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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) Word has length 15 [2024-10-14 20:36:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:42,959 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:36:42,959 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 20:36:42,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:36:42,960 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:42,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 20:36:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-14 20:36:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-14 20:36:42,971 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 15 [2024-10-14 20:36:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:42,971 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-14 20:36:42,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 20:36:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-14 20:36:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:36:42,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:42,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:42,990 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 20:36:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:43,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1118794946, now seen corresponding path program 1 times [2024-10-14 20:36:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198720880] [2024-10-14 20:36:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198720880] [2024-10-14 20:36:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198720880] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403806293] [2024-10-14 20:36:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:43,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:43,264 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 20:36:43,265 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 20:36:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:43,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:36:43,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:43,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403806293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:43,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-10-14 20:36:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54151780] [2024-10-14 20:36:43,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:43,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 20:36:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 20:36:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-14 20:36:43,511 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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 20:36:45,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:49,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:49,882 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-10-14 20:36:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 20:36:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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) Word has length 16 [2024-10-14 20:36:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:49,884 INFO L225 Difference]: With dead ends: 86 [2024-10-14 20:36:49,884 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 20:36:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-14 20:36:49,885 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:49,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-10-14 20:36:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 20:36:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-10-14 20:36:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:36:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-14 20:36:49,897 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 16 [2024-10-14 20:36:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-14 20:36:49,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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 20:36:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-14 20:36:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 20:36:49,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:49,900 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 20:36:49,916 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 20:36:50,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:50,101 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:50,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1351280755, now seen corresponding path program 1 times [2024-10-14 20:36:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946531173] [2024-10-14 20:36:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:36:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:36:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:36:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:36:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:36:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 20:36:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 20:36:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:36:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:36:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:36:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 20:36:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 20:36:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 20:36:50,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946531173] [2024-10-14 20:36:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946531173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540982417] [2024-10-14 20:36:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:50,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:50,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:50,620 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 20:36:50,623 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 20:36:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:50,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 20:36:50,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-14 20:36:51,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 20:36:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540982417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:51,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2024-10-14 20:36:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994695806] [2024-10-14 20:36:51,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:51,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-14 20:36:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-14 20:36:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 20:36:51,590 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 20:36:56,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:58,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:37:03,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:37:07,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:37:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:37:07,651 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2024-10-14 20:37:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 20:37:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 93 [2024-10-14 20:37:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:37:07,654 INFO L225 Difference]: With dead ends: 236 [2024-10-14 20:37:07,654 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 20:37:07,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1016, Invalid=3144, Unknown=0, NotChecked=0, Total=4160 [2024-10-14 20:37:07,659 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 264 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 60 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:37:07,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 300 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 355 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2024-10-14 20:37:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 20:37:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2024-10-14 20:37:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.135135135135135) internal successors, (126), 111 states have internal predecessors, (126), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 20:37:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 234 transitions. [2024-10-14 20:37:07,705 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 234 transitions. Word has length 93 [2024-10-14 20:37:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:37:07,705 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 234 transitions. [2024-10-14 20:37:07,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 20:37:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 234 transitions. [2024-10-14 20:37:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-14 20:37:07,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:37:07,717 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-14 20:37:07,733 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 20:37:07,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:37:07,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:37:07,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:37:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 958093722, now seen corresponding path program 2 times [2024-10-14 20:37:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:37:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992607201] [2024-10-14 20:37:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:37:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:37:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:37:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:37:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:37:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:37:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 20:37:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 20:37:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:37:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:37:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:37:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 20:37:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 20:37:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 20:37:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 20:37:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 20:37:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 20:37:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 20:37:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 20:37:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 20:37:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 20:37:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 20:37:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 20:37:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 20:37:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 20:37:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 20:37:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 20:37:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-14 20:37:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-14 20:37:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 20:37:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 20:37:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 20:37:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-14 20:37:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-14 20:37:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 20:37:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-14 20:37:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-14 20:37:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-14 20:37:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:37:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:37:09,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992607201] [2024-10-14 20:37:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992607201] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:37:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368134464] [2024-10-14 20:37:09,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:37:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:37:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:37:09,396 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 20:37:09,397 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 20:37:09,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:37:09,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:37:09,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 20:37:09,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:37:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 2388 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-14 20:37:10,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:37:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:37:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368134464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:37:11,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:37:11,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2024-10-14 20:37:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196497607] [2024-10-14 20:37:11,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:37:11,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-14 20:37:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:37:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-14 20:37:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 20:37:11,342 INFO L87 Difference]: Start difference. First operand 175 states and 234 transitions. Second operand has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-14 20:37:15,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:37:19,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:37:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:37:19,351 INFO L93 Difference]: Finished difference Result 592 states and 805 transitions. [2024-10-14 20:37:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-14 20:37:19,352 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) Word has length 242 [2024-10-14 20:37:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:37:19,358 INFO L225 Difference]: With dead ends: 592 [2024-10-14 20:37:19,358 INFO L226 Difference]: Without dead ends: 591 [2024-10-14 20:37:19,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2197, Invalid=7309, Unknown=0, NotChecked=0, Total=9506 [2024-10-14 20:37:19,362 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 440 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-14 20:37:19,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 287 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 415 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2024-10-14 20:37:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-14 20:37:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 276. [2024-10-14 20:37:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 20:37:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 374 transitions. [2024-10-14 20:37:19,400 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 374 transitions. Word has length 242 [2024-10-14 20:37:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:37:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 374 transitions. [2024-10-14 20:37:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-14 20:37:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 374 transitions. [2024-10-14 20:37:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-14 20:37:19,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:37:19,406 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-14 20:37:19,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 20:37:19,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:37:19,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:37:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:37:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1972813965, now seen corresponding path program 1 times [2024-10-14 20:37:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:37:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759376033] [2024-10-14 20:37:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:37:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:37:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 20:37:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:37:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 20:37:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 20:37:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 20:37:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:37:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 20:37:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 20:37:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:37:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 20:37:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 20:37:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 20:37:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 20:37:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 20:37:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 20:37:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 20:37:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 20:37:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 20:37:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-14 20:37:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 20:37:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 20:37:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 20:37:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 20:37:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 20:37:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 20:37:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 20:37:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-14 20:37:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-14 20:37:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-14 20:37:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-14 20:37:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 20:37:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-14 20:37:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-14 20:37:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-14 20:37:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-14 20:37:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 20:37:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-14 20:37:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:37:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759376033] [2024-10-14 20:37:20,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759376033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:37:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606084460] [2024-10-14 20:37:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:37:20,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:37:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:37:20,678 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 20:37:20,680 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 20:37:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:20,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 20:37:20,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:37:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-14 20:37:21,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:37:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-14 20:37:21,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606084460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:37:21,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:37:21,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 41 [2024-10-14 20:37:21,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332764380] [2024-10-14 20:37:21,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:37:21,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 20:37:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:37:21,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 20:37:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 20:37:21,945 INFO L87 Difference]: Start difference. First operand 276 states and 374 transitions. Second operand has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 20:37:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:37:22,980 INFO L93 Difference]: Finished difference Result 489 states and 648 transitions. [2024-10-14 20:37:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-14 20:37:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 266 [2024-10-14 20:37:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:37:22,984 INFO L225 Difference]: With dead ends: 489 [2024-10-14 20:37:22,985 INFO L226 Difference]: Without dead ends: 373 [2024-10-14 20:37:22,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1752, Invalid=3798, Unknown=0, NotChecked=0, Total=5550 [2024-10-14 20:37:22,991 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 352 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:37:22,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 181 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:37:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-14 20:37:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 325. [2024-10-14 20:37:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 226 states have (on average 1.1504424778761062) internal successors, (260), 226 states have internal predecessors, (260), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 20:37:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 428 transitions. [2024-10-14 20:37:23,023 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 428 transitions. Word has length 266 [2024-10-14 20:37:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:37:23,023 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 428 transitions. [2024-10-14 20:37:23,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 20:37:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 428 transitions. [2024-10-14 20:37:23,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-14 20:37:23,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:37:23,027 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-14 20:37:23,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 20:37:23,231 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,SelfDestructingSolverStorable11 [2024-10-14 20:37:23,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:37:23,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:37:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash 279119509, now seen corresponding path program 3 times [2024-10-14 20:37:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:37:23,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696370521] [2024-10-14 20:37:23,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:37:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:37:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 20:37:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 20:37:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:37:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 20:37:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 20:37:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 20:37:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 20:37:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 20:37:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 20:37:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 20:37:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 20:37:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 20:37:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 20:37:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 20:37:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 20:37:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 20:37:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 20:37:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:24,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 20:37:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 20:37:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 20:37:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-14 20:37:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 20:37:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 20:37:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 20:37:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 20:37:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 20:37:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 20:37:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 20:37:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-14 20:37:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-14 20:37:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-14 20:37:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-14 20:37:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-14 20:37:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-14 20:37:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-14 20:37:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-14 20:37:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:37:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:37:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:37:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696370521] [2024-10-14 20:37:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696370521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:37:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006330653] [2024-10-14 20:37:25,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:37:25,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:37:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:37:25,068 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 20:37:25,069 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 20:37:25,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 20:37:25,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:37:25,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:37:25,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:37:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2024-10-14 20:37:25,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:37:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006330653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:37:25,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:37:25,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [34] total 37 [2024-10-14 20:37:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16503502] [2024-10-14 20:37:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:37:25,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:37:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:37:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:37:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 20:37:25,363 INFO L87 Difference]: Start difference. First operand 325 states and 428 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:37:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:37:25,585 INFO L93 Difference]: Finished difference Result 333 states and 436 transitions. [2024-10-14 20:37:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:37:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 267 [2024-10-14 20:37:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:37:25,586 INFO L225 Difference]: With dead ends: 333 [2024-10-14 20:37:25,586 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:37:25,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 20:37:25,590 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:37:25,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:37:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:37:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:37:25,592 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 20:37:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:37:25,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2024-10-14 20:37:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:37:25,593 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:37:25,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:37:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:37:25,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:37:25,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 20:37:25,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 20:37:25,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 20:37:25,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 20:37:25,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 20:37:25,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 20:37:25,801 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:37:25,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:37:27,219 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:37:27,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:37:27 BoogieIcfgContainer [2024-10-14 20:37:27,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:37:27,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:37:27,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:37:27,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:37:27,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:39" (3/4) ... [2024-10-14 20:37:27,241 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:37:27,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:37:27,250 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 20:37:27,250 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 20:37:27,250 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:37:27,251 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:37:27,344 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:37:27,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:37:27,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:37:27,348 INFO L158 Benchmark]: Toolchain (without parser) took 48588.35ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 148.3MB in the beginning and 210.6MB in the end (delta: -62.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,348 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 147.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:37:27,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.00ms. Allocated memory is still 178.3MB. Free memory was 148.1MB in the beginning and 140.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.09ms. Allocated memory is still 178.3MB. Free memory was 140.6MB in the beginning and 139.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,349 INFO L158 Benchmark]: Boogie Preprocessor took 40.86ms. Allocated memory is still 178.3MB. Free memory was 139.5MB in the beginning and 137.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,349 INFO L158 Benchmark]: RCFGBuilder took 527.23ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 138.9MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,349 INFO L158 Benchmark]: TraceAbstraction took 47558.59ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 137.9MB in the beginning and 214.8MB in the end (delta: -76.9MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,349 INFO L158 Benchmark]: Witness Printer took 109.30ms. Allocated memory is still 257.9MB. Free memory was 214.8MB in the beginning and 210.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:37:27,353 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.87ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 147.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.00ms. Allocated memory is still 178.3MB. Free memory was 148.1MB in the beginning and 140.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.09ms. Allocated memory is still 178.3MB. Free memory was 140.6MB in the beginning and 139.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.86ms. Allocated memory is still 178.3MB. Free memory was 139.5MB in the beginning and 137.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.23ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 138.9MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47558.59ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 137.9MB in the beginning and 214.8MB in the end (delta: -76.9MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. * Witness Printer took 109.30ms. Allocated memory is still 257.9MB. Free memory was 214.8MB in the beginning and 210.6MB 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.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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 46.1s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1311 SdHoareTripleChecker+Valid, 28.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 1854 SdHoareTripleChecker+Invalid, 28.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1497 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 357 mSDtfsCounter, 1392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2068 GetRequests, 1701 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5549 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 479 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1899 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4683 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1633 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 19649/23648 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 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((0 <= ((long long) counter + 2147483647)) && (counter <= 50)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((counter <= 2147483641) && (0 <= ((long long) counter + 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:37:27,397 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