./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/mannadiv_unwindbound5.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/mannadiv_unwindbound5.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 aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:56:51,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:56:51,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:56:51,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:56:51,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:56:51,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:56:51,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:56:51,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:56:51,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:56:51,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:56:51,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:56:51,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:56:51,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:56:51,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:56:51,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:56:51,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:56:51,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:56:51,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:56:51,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:56:51,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:56:51,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:56:51,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:56:51,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:56:51,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:56:51,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:56:51,680 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:56:51,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:56:51,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:56:51,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:56:51,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:56:51,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:56:51,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:56:51,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:56:51,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:56:51,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:56:51,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:56:51,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:56:51,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:56:51,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:56:51,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:56:51,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:56:51,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:56:51,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:56:51,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:56:51,687 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 -> aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 [2024-10-14 20:56:51,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:56:51,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:56:52,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:56:52,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:56:52,005 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:56:52,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2024-10-14 20:56:53,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:56:53,531 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:56:53,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2024-10-14 20:56:53,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b627b9c6a/62d620ffdf754e87bfc6edfa2016356c/FLAGf1cbd0078 [2024-10-14 20:56:53,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b627b9c6a/62d620ffdf754e87bfc6edfa2016356c [2024-10-14 20:56:53,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:56:53,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:56:53,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:56:53,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:56:53,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:56:53,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338b8f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53, skipping insertion in model container [2024-10-14 20:56:53,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:56:53,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:56:53,765 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:56:53,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:56:53,801 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:56:53,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53 WrapperNode [2024-10-14 20:56:53,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:56:53,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:56:53,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:56:53,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:56:53,810 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:56:53" (1/1) ... [2024-10-14 20:56:53,820 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:56:53" (1/1) ... [2024-10-14 20:56:53,845 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-14 20:56:53,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:56:53,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:56:53,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:56:53,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:56:53,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,878 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:56:53,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:56:53,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:56:53,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:56:53,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:56:53,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (1/1) ... [2024-10-14 20:56:53,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:56:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:53,931 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:56:53,934 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:56:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:56:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 20:56:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 20:56:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:56:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:56:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:56:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:56:53,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:56:54,034 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:56:54,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:56:54,259 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-14 20:56:54,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:56:54,295 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:56:54,298 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:56:54,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:54 BoogieIcfgContainer [2024-10-14 20:56:54,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:56:54,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:56:54,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:56:54,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:56:54,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:56:53" (1/3) ... [2024-10-14 20:56:54,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502ceae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:56:54, skipping insertion in model container [2024-10-14 20:56:54,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:53" (2/3) ... [2024-10-14 20:56:54,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502ceae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:56:54, skipping insertion in model container [2024-10-14 20:56:54,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:54" (3/3) ... [2024-10-14 20:56:54,308 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2024-10-14 20:56:54,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:56:54,323 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-14 20:56:54,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:56:54,386 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;@66e5da68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:56:54,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-14 20:56:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.8) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:56:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:56:54,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:54,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:54,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1616721719, now seen corresponding path program 1 times [2024-10-14 20:56:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:54,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285130904] [2024-10-14 20:56:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285130904] [2024-10-14 20:56:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285130904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:54,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:54,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:56:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600925629] [2024-10-14 20:56:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:54,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:56:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:56:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:56:54,584 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.8) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 20:56:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:54,611 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2024-10-14 20:56:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:56:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 20:56:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:54,618 INFO L225 Difference]: With dead ends: 126 [2024-10-14 20:56:54,618 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 20:56:54,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:56:54,623 INFO L432 NwaCegarLoop]: 66 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, 66 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:56:54,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 20:56:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 20:56:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 55 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 20:56:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-10-14 20:56:54,657 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2024-10-14 20:56:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:54,657 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-10-14 20:56:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 20:56:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-10-14 20:56:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:56:54,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:54,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:56:54,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:54,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1919924458, now seen corresponding path program 1 times [2024-10-14 20:56:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:54,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540888120] [2024-10-14 20:56:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540888120] [2024-10-14 20:56:54,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540888120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:54,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:54,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782511567] [2024-10-14 20:56:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:54,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:54,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:54,795 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:54,860 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-14 20:56:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-14 20:56:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:54,862 INFO L225 Difference]: With dead ends: 75 [2024-10-14 20:56:54,862 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 20:56:54,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:56:54,863 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:54,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 20:56:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 20:56:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.631578947368421) internal successors, (62), 59 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 20:56:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-14 20:56:54,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2024-10-14 20:56:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:54,878 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-14 20:56:54,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-14 20:56:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 20:56:54,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:54,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:56:54,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:54,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -390003592, now seen corresponding path program 1 times [2024-10-14 20:56:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111062326] [2024-10-14 20:56:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275538128] [2024-10-14 20:56:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:54,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:54,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:54,909 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:56:54,911 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:56:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:54,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:56:54,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:55,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111062326] [2024-10-14 20:56:55,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:56:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275538128] [2024-10-14 20:56:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275538128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:55,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:56:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506377717] [2024-10-14 20:56:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:55,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:56:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:56:55,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:56:55,014 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:55,096 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-10-14 20:56:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:56:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-14 20:56:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:55,100 INFO L225 Difference]: With dead ends: 104 [2024-10-14 20:56:55,100 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 20:56:55,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:56:55,103 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:55,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 20:56:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-10-14 20:56:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.65) internal successors, (99), 81 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:56:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-10-14 20:56:55,122 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 17 [2024-10-14 20:56:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:55,122 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-10-14 20:56:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-10-14 20:56:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:56:55,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:55,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:55,141 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:56:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:55,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1131295462, now seen corresponding path program 1 times [2024-10-14 20:56:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444438954] [2024-10-14 20:56:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:55,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444438954] [2024-10-14 20:56:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444438954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230654169] [2024-10-14 20:56:55,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:55,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:55,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:55,443 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:55,708 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2024-10-14 20:56:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:55,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-14 20:56:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:55,711 INFO L225 Difference]: With dead ends: 138 [2024-10-14 20:56:55,711 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 20:56:55,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:55,713 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:55,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 20:56:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-14 20:56:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 115 states have internal predecessors, (150), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2024-10-14 20:56:55,726 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 19 [2024-10-14 20:56:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:55,726 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2024-10-14 20:56:55,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2024-10-14 20:56:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 20:56:55,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:55,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:55,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:56:55,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:55,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -710420897, now seen corresponding path program 1 times [2024-10-14 20:56:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693738142] [2024-10-14 20:56:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693738142] [2024-10-14 20:56:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693738142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180002307] [2024-10-14 20:56:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:55,837 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:56,028 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-10-14 20:56:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-14 20:56:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:56,030 INFO L225 Difference]: With dead ends: 135 [2024-10-14 20:56:56,030 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 20:56:56,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:56,031 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:56,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 20:56:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-10-14 20:56:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 111 states have internal predecessors, (141), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2024-10-14 20:56:56,049 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 20 [2024-10-14 20:56:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2024-10-14 20:56:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2024-10-14 20:56:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:56:56,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:56,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:56:56,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -548211268, now seen corresponding path program 1 times [2024-10-14 20:56:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89167363] [2024-10-14 20:56:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:56,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89167363] [2024-10-14 20:56:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89167363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925893883] [2024-10-14 20:56:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:56,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:56,258 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:56:56,259 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:56:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:56,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:56,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:56,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925893883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:56,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:56,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-14 20:56:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259022191] [2024-10-14 20:56:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:56,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:56,457 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:56,569 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2024-10-14 20:56:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 20:56:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:56,571 INFO L225 Difference]: With dead ends: 123 [2024-10-14 20:56:56,571 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 20:56:56,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:56,573 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 81 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:56,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 72 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 20:56:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-14 20:56:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 111 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2024-10-14 20:56:56,593 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 21 [2024-10-14 20:56:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:56,594 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2024-10-14 20:56:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2024-10-14 20:56:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:56:56,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:56,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:56,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 20:56:56,799 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:56:56,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:56,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash 185319937, now seen corresponding path program 1 times [2024-10-14 20:56:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228235859] [2024-10-14 20:56:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593253046] [2024-10-14 20:56:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:56,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:56,821 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:56:56,823 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:56:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:56,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:56,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:56,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228235859] [2024-10-14 20:56:56,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:56:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593253046] [2024-10-14 20:56:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593253046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765616688] [2024-10-14 20:56:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:56,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:56,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:56,973 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:57,083 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2024-10-14 20:56:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:57,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-14 20:56:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:57,085 INFO L225 Difference]: With dead ends: 121 [2024-10-14 20:56:57,085 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 20:56:57,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:56:57,086 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:57,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 77 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 20:56:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-14 20:56:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 111 states have internal predecessors, (139), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:56:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-10-14 20:56:57,102 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 22 [2024-10-14 20:56:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:57,102 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-10-14 20:56:57,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:56:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-10-14 20:56:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 20:56:57,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:57,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:57,120 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:56:57,304 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:56:57,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1256432811, now seen corresponding path program 1 times [2024-10-14 20:56:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876695962] [2024-10-14 20:56:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:57,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876695962] [2024-10-14 20:56:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876695962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:57,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701185106] [2024-10-14 20:56:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:57,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:57,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:57,459 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:56:57,460 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:56:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:57,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:56:57,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:57,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:56:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701185106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:57,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 20:56:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109474970] [2024-10-14 20:56:57,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:57,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:56:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:56:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:57,647 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 20:56:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:57,758 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2024-10-14 20:56:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:56:57,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-14 20:56:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:57,760 INFO L225 Difference]: With dead ends: 191 [2024-10-14 20:56:57,762 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 20:56:57,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:56:57,763 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:57,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 239 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 20:56:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2024-10-14 20:56:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.548148148148148) internal successors, (209), 156 states have internal predecessors, (209), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2024-10-14 20:56:57,773 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 34 [2024-10-14 20:56:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:57,774 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2024-10-14 20:56:57,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 20:56:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2024-10-14 20:56:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 20:56:57,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:57,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:57,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:56:57,979 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:56:57,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:57,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -294711385, now seen corresponding path program 1 times [2024-10-14 20:56:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091710256] [2024-10-14 20:56:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091710256] [2024-10-14 20:56:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091710256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:58,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458267580] [2024-10-14 20:56:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:58,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:58,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:58,045 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:58,080 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2024-10-14 20:56:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:58,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-14 20:56:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:58,082 INFO L225 Difference]: With dead ends: 177 [2024-10-14 20:56:58,082 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 20:56:58,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:56:58,082 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:58,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 20:56:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-10-14 20:56:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.511111111111111) internal successors, (204), 154 states have internal predecessors, (204), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2024-10-14 20:56:58,094 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 35 [2024-10-14 20:56:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:58,094 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2024-10-14 20:56:58,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2024-10-14 20:56:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 20:56:58,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:58,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:58,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:56:58,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:58,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 250201833, now seen corresponding path program 1 times [2024-10-14 20:56:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426887026] [2024-10-14 20:56:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:58,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:58,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426887026] [2024-10-14 20:56:58,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426887026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:58,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252277670] [2024-10-14 20:56:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:58,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:58,205 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:56:58,206 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:56:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:56:58,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252277670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 20:56:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990093181] [2024-10-14 20:56:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:56:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:56:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:58,309 INFO L87 Difference]: Start difference. First operand 165 states and 220 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, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:58,336 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2024-10-14 20:56:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:56:58,336 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, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-14 20:56:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:58,338 INFO L225 Difference]: With dead ends: 165 [2024-10-14 20:56:58,338 INFO L226 Difference]: Without dead ends: 164 [2024-10-14 20:56:58,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 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:56:58,339 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:58,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-14 20:56:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-14 20:56:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.474074074074074) internal successors, (199), 153 states have internal predecessors, (199), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2024-10-14 20:56:58,350 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 37 [2024-10-14 20:56:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:58,352 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2024-10-14 20:56:58,352 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, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2024-10-14 20:56:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 20:56:58,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:58,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:58,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 20:56:58,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 20:56:58,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:58,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash -833677725, now seen corresponding path program 1 times [2024-10-14 20:56:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26367850] [2024-10-14 20:56:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:58,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26367850] [2024-10-14 20:56:58,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26367850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:58,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933439589] [2024-10-14 20:56:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:58,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:58,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:58,655 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:56:58,656 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:56:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:58,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:56:58,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:58,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:56:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933439589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:58,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:56:58,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 20:56:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110623065] [2024-10-14 20:56:58,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:58,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:56:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:56:58,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:56:58,754 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:58,798 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2024-10-14 20:56:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 20:56:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:58,802 INFO L225 Difference]: With dead ends: 174 [2024-10-14 20:56:58,802 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 20:56:58,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 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:56:58,802 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 184 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:56:58,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 20:56:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2024-10-14 20:56:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 152 states have internal predecessors, (194), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:56:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2024-10-14 20:56:58,813 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 38 [2024-10-14 20:56:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:58,813 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2024-10-14 20:56:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:56:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2024-10-14 20:56:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 20:56:58,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:58,814 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:58,831 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:56:59,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:59,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:59,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash -260192512, now seen corresponding path program 1 times [2024-10-14 20:56:59,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:59,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232313611] [2024-10-14 20:56:59,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:59,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:56:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232313611] [2024-10-14 20:56:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232313611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836800468] [2024-10-14 20:56:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:59,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:59,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:59,122 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:56:59,123 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:56:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:59,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:56:59,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:59,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836800468] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:59,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:59,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-14 20:56:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773639845] [2024-10-14 20:56:59,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:59,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 20:56:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 20:56:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:56:59,303 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 20:56:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:59,417 INFO L93 Difference]: Finished difference Result 305 states and 362 transitions. [2024-10-14 20:56:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:56:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 40 [2024-10-14 20:56:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:59,419 INFO L225 Difference]: With dead ends: 305 [2024-10-14 20:56:59,419 INFO L226 Difference]: Without dead ends: 293 [2024-10-14 20:56:59,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 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:56:59,421 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 94 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:59,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 314 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-14 20:56:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 251. [2024-10-14 20:56:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 217 states have (on average 1.4101382488479262) internal successors, (306), 234 states have internal predecessors, (306), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 20:56:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 328 transitions. [2024-10-14 20:56:59,437 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 328 transitions. Word has length 40 [2024-10-14 20:56:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:59,437 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 328 transitions. [2024-10-14 20:56:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 20:56:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2024-10-14 20:56:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 20:56:59,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:59,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:59,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 20:56:59,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:59,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:56:59,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash -260192497, now seen corresponding path program 1 times [2024-10-14 20:56:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:59,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032631587] [2024-10-14 20:56:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:56:59,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193359508] [2024-10-14 20:56:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:59,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:59,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:59,658 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:56:59,659 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:56:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:59,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:59,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:56:59,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032631587] [2024-10-14 20:57:00,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:57:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193359508] [2024-10-14 20:57:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193359508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:00,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:57:00,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-14 20:57:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258767006] [2024-10-14 20:57:00,013 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:00,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:57:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:57:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:57:00,014 INFO L87 Difference]: Start difference. First operand 251 states and 328 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:00,136 INFO L93 Difference]: Finished difference Result 258 states and 331 transitions. [2024-10-14 20:57:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:57:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-14 20:57:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:00,138 INFO L225 Difference]: With dead ends: 258 [2024-10-14 20:57:00,138 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 20:57:00,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:57:00,139 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:00,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 77 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:57:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 20:57:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2024-10-14 20:57:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.3073394495412844) internal successors, (285), 230 states have internal predecessors, (285), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 20:57:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2024-10-14 20:57:00,151 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 40 [2024-10-14 20:57:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:00,151 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2024-10-14 20:57:00,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2024-10-14 20:57:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 20:57:00,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:00,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:00,169 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:57:00,352 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,SelfDestructingSolverStorable12 [2024-10-14 20:57:00,353 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 523967238, now seen corresponding path program 1 times [2024-10-14 20:57:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564944610] [2024-10-14 20:57:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:57:00,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4234596] [2024-10-14 20:57:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:00,365 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:57:00,366 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:57:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:00,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:57:00,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:00,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564944610] [2024-10-14 20:57:00,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:57:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4234596] [2024-10-14 20:57:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4234596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:00,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:57:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-14 20:57:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681062746] [2024-10-14 20:57:00,955 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:00,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:57:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:57:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:57:00,956 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:01,140 INFO L93 Difference]: Finished difference Result 335 states and 415 transitions. [2024-10-14 20:57:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:57:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-10-14 20:57:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:01,143 INFO L225 Difference]: With dead ends: 335 [2024-10-14 20:57:01,143 INFO L226 Difference]: Without dead ends: 330 [2024-10-14 20:57:01,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:57:01,144 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 92 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:01,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 116 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:57:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-14 20:57:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2024-10-14 20:57:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 294 states have internal predecessors, (363), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 20:57:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 391 transitions. [2024-10-14 20:57:01,160 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 391 transitions. Word has length 41 [2024-10-14 20:57:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:01,160 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 391 transitions. [2024-10-14 20:57:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 391 transitions. [2024-10-14 20:57:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 20:57:01,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:01,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:01,177 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:57:01,361 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,SelfDestructingSolverStorable13 [2024-10-14 20:57:01,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:01,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1247688999, now seen corresponding path program 1 times [2024-10-14 20:57:01,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:01,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184326055] [2024-10-14 20:57:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:01,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184326055] [2024-10-14 20:57:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184326055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:01,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992433931] [2024-10-14 20:57:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:01,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:01,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:01,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:57:01,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 20:57:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:01,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:57:01,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:01,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:57:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992433931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:57:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:57:01,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-14 20:57:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109626157] [2024-10-14 20:57:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:57:01,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:57:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:01,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:57:01,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:57:01,579 INFO L87 Difference]: Start difference. First operand 314 states and 391 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:01,695 INFO L93 Difference]: Finished difference Result 314 states and 391 transitions. [2024-10-14 20:57:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:57:01,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-10-14 20:57:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:01,697 INFO L225 Difference]: With dead ends: 314 [2024-10-14 20:57:01,698 INFO L226 Difference]: Without dead ends: 312 [2024-10-14 20:57:01,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:57:01,700 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:01,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 75 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:57:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-14 20:57:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2024-10-14 20:57:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 289 states have internal predecessors, (356), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 20:57:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 384 transitions. [2024-10-14 20:57:01,715 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 384 transitions. Word has length 42 [2024-10-14 20:57:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:01,715 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 384 transitions. [2024-10-14 20:57:01,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 384 transitions. [2024-10-14 20:57:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:57:01,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:01,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:01,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 20:57:01,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 20:57:01,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:01,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 23653362, now seen corresponding path program 1 times [2024-10-14 20:57:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778728209] [2024-10-14 20:57:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:02,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:57:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778728209] [2024-10-14 20:57:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778728209] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267488649] [2024-10-14 20:57:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:02,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:02,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:02,087 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:57:02,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 20:57:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:02,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:57:02,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:02,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267488649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:02,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 20:57:02,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2024-10-14 20:57:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28288977] [2024-10-14 20:57:02,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 20:57:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 20:57:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:57:02,413 INFO L87 Difference]: Start difference. First operand 309 states and 384 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 20:57:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:02,934 INFO L93 Difference]: Finished difference Result 332 states and 399 transitions. [2024-10-14 20:57:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 20:57:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-14 20:57:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:02,936 INFO L225 Difference]: With dead ends: 332 [2024-10-14 20:57:02,936 INFO L226 Difference]: Without dead ends: 313 [2024-10-14 20:57:02,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-10-14 20:57:02,937 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 140 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:02,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 186 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:57:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-14 20:57:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2024-10-14 20:57:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 267 states have (on average 1.2134831460674158) internal successors, (324), 278 states have internal predecessors, (324), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 20:57:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 352 transitions. [2024-10-14 20:57:02,955 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 352 transitions. Word has length 43 [2024-10-14 20:57:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:02,955 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 352 transitions. [2024-10-14 20:57:02,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 20:57:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 352 transitions. [2024-10-14 20:57:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:57:02,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:02,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:02,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 20:57:03,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 20:57:03,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash 733254281, now seen corresponding path program 1 times [2024-10-14 20:57:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161245723] [2024-10-14 20:57:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:03,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:03,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161245723] [2024-10-14 20:57:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161245723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:57:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:57:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:57:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004240544] [2024-10-14 20:57:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:57:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:57:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:57:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:57:03,208 INFO L87 Difference]: Start difference. First operand 297 states and 352 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:03,386 INFO L93 Difference]: Finished difference Result 298 states and 352 transitions. [2024-10-14 20:57:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:57:03,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-10-14 20:57:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:03,389 INFO L225 Difference]: With dead ends: 298 [2024-10-14 20:57:03,389 INFO L226 Difference]: Without dead ends: 297 [2024-10-14 20:57:03,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:57:03,390 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:03,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:57:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-14 20:57:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-10-14 20:57:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 267 states have (on average 1.1910112359550562) internal successors, (318), 278 states have internal predecessors, (318), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 20:57:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 346 transitions. [2024-10-14 20:57:03,405 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 346 transitions. Word has length 44 [2024-10-14 20:57:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 346 transitions. [2024-10-14 20:57:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 20:57:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 346 transitions. [2024-10-14 20:57:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:57:03,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:03,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:03,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 20:57:03,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:03,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1596888275, now seen corresponding path program 1 times [2024-10-14 20:57:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:03,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196677409] [2024-10-14 20:57:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:57:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196677409] [2024-10-14 20:57:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196677409] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694700020] [2024-10-14 20:57:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:03,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:03,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:03,542 INFO L229 MonitoredProcess]: Starting monitored process 13 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:57:03,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 20:57:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:03,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 20:57:03,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:57:03,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:57:03,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694700020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:03,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:03,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-14 20:57:03,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683818350] [2024-10-14 20:57:03,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:03,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 20:57:03,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 20:57:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-14 20:57:03,946 INFO L87 Difference]: Start difference. First operand 297 states and 346 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 20:57:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:04,500 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2024-10-14 20:57:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:57:04,500 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-10-14 20:57:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:04,502 INFO L225 Difference]: With dead ends: 302 [2024-10-14 20:57:04,502 INFO L226 Difference]: Without dead ends: 299 [2024-10-14 20:57:04,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-10-14 20:57:04,503 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 183 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:04,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 169 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:57:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-14 20:57:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2024-10-14 20:57:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 267 states have (on average 1.149812734082397) internal successors, (307), 275 states have internal predecessors, (307), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 20:57:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 335 transitions. [2024-10-14 20:57:04,519 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 335 transitions. Word has length 44 [2024-10-14 20:57:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:04,519 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 335 transitions. [2024-10-14 20:57:04,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 20:57:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 335 transitions. [2024-10-14 20:57:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:57:04,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:04,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:04,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 20:57:04,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 20:57:04,721 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:04,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2036070966, now seen corresponding path program 1 times [2024-10-14 20:57:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365497995] [2024-10-14 20:57:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:57:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995087491] [2024-10-14 20:57:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:04,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:04,735 INFO L229 MonitoredProcess]: Starting monitored process 14 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:57:04,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 20:57:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:04,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 20:57:04,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:04,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365497995] [2024-10-14 20:57:05,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:57:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995087491] [2024-10-14 20:57:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995087491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:05,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 20:57:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-14 20:57:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919801359] [2024-10-14 20:57:05,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 20:57:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 20:57:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:57:05,132 INFO L87 Difference]: Start difference. First operand 294 states and 335 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 20:57:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:05,554 INFO L93 Difference]: Finished difference Result 394 states and 449 transitions. [2024-10-14 20:57:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:57:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-10-14 20:57:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:05,556 INFO L225 Difference]: With dead ends: 394 [2024-10-14 20:57:05,556 INFO L226 Difference]: Without dead ends: 274 [2024-10-14 20:57:05,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:57:05,557 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 86 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:05,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 135 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:57:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-14 20:57:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2024-10-14 20:57:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 247 states have (on average 1.1093117408906883) internal successors, (274), 254 states have internal predecessors, (274), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 20:57:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2024-10-14 20:57:05,572 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 45 [2024-10-14 20:57:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:05,573 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2024-10-14 20:57:05,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 20:57:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2024-10-14 20:57:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 20:57:05,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:05,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:05,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 20:57:05,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:05,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:05,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1171212445, now seen corresponding path program 2 times [2024-10-14 20:57:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129611669] [2024-10-14 20:57:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:57:05,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493991115] [2024-10-14 20:57:05,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:57:05,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:05,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:05,791 INFO L229 MonitoredProcess]: Starting monitored process 15 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:57:05,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 20:57:05,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:57:05,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:57:05,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 20:57:05,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 20:57:05,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 20:57:06,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129611669] [2024-10-14 20:57:06,270 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:57:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493991115] [2024-10-14 20:57:06,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493991115] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:06,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 20:57:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 20:57:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223655856] [2024-10-14 20:57:06,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:06,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 20:57:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 20:57:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:57:06,273 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 20:57:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:07,038 INFO L93 Difference]: Finished difference Result 441 states and 506 transitions. [2024-10-14 20:57:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 20:57:07,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2024-10-14 20:57:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:07,040 INFO L225 Difference]: With dead ends: 441 [2024-10-14 20:57:07,040 INFO L226 Difference]: Without dead ends: 428 [2024-10-14 20:57:07,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:57:07,041 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 208 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:07,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 253 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 20:57:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-14 20:57:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 390. [2024-10-14 20:57:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 359 states have (on average 1.128133704735376) internal successors, (405), 366 states have internal predecessors, (405), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 20:57:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 443 transitions. [2024-10-14 20:57:07,063 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 443 transitions. Word has length 64 [2024-10-14 20:57:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:07,063 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 443 transitions. [2024-10-14 20:57:07,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 20:57:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 443 transitions. [2024-10-14 20:57:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 20:57:07,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:07,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:07,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 20:57:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:07,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 397103473, now seen corresponding path program 1 times [2024-10-14 20:57:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740398634] [2024-10-14 20:57:07,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:57:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:57:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 20:57:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740398634] [2024-10-14 20:57:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740398634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969516146] [2024-10-14 20:57:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:07,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:07,358 INFO L229 MonitoredProcess]: Starting monitored process 16 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:57:07,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 20:57:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:07,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:57:07,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 20:57:07,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 20:57:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969516146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:07,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:07,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-14 20:57:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091005296] [2024-10-14 20:57:07,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:57:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:07,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:57:07,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:57:07,558 INFO L87 Difference]: Start difference. First operand 390 states and 443 transitions. Second operand has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 20:57:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:07,738 INFO L93 Difference]: Finished difference Result 1011 states and 1242 transitions. [2024-10-14 20:57:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:57:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 76 [2024-10-14 20:57:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:07,743 INFO L225 Difference]: With dead ends: 1011 [2024-10-14 20:57:07,743 INFO L226 Difference]: Without dead ends: 1009 [2024-10-14 20:57:07,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:57:07,744 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:07,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 175 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:57:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-14 20:57:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2024-10-14 20:57:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 926 states have (on average 1.1339092872570193) internal successors, (1050), 931 states have internal predecessors, (1050), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 20:57:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1154 transitions. [2024-10-14 20:57:07,802 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1154 transitions. Word has length 76 [2024-10-14 20:57:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:07,803 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1154 transitions. [2024-10-14 20:57:07,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 20:57:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1154 transitions. [2024-10-14 20:57:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 20:57:07,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:07,804 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:07,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 20:57:08,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:08,005 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:08,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:08,005 INFO L85 PathProgramCache]: Analyzing trace with hash 267410460, now seen corresponding path program 1 times [2024-10-14 20:57:08,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:08,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145474884] [2024-10-14 20:57:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:57:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:57:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:57:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145474884] [2024-10-14 20:57:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145474884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230926476] [2024-10-14 20:57:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:08,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:08,203 INFO L229 MonitoredProcess]: Starting monitored process 17 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:57:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 20:57:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:08,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 20:57:08,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:57:08,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:57:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230926476] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:08,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-14 20:57:08,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456534902] [2024-10-14 20:57:08,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:08,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 20:57:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 20:57:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:57:08,549 INFO L87 Difference]: Start difference. First operand 989 states and 1154 transitions. Second operand has 16 states, 15 states have (on average 9.933333333333334) internal successors, (149), 16 states have internal predecessors, (149), 8 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 20:57:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:09,150 INFO L93 Difference]: Finished difference Result 1612 states and 1865 transitions. [2024-10-14 20:57:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 20:57:09,151 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 9.933333333333334) internal successors, (149), 16 states have internal predecessors, (149), 8 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 89 [2024-10-14 20:57:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:09,158 INFO L225 Difference]: With dead ends: 1612 [2024-10-14 20:57:09,158 INFO L226 Difference]: Without dead ends: 1594 [2024-10-14 20:57:09,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2024-10-14 20:57:09,161 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 159 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:09,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 240 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:57:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-14 20:57:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1546. [2024-10-14 20:57:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1462 states have (on average 1.0957592339261286) internal successors, (1602), 1467 states have internal predecessors, (1602), 73 states have call successors, (73), 5 states have call predecessors, (73), 5 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-14 20:57:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1748 transitions. [2024-10-14 20:57:09,247 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1748 transitions. Word has length 89 [2024-10-14 20:57:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:09,247 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 1748 transitions. [2024-10-14 20:57:09,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 9.933333333333334) internal successors, (149), 16 states have internal predecessors, (149), 8 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 20:57:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1748 transitions. [2024-10-14 20:57:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 20:57:09,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:09,249 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:09,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-14 20:57:09,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 20:57:09,454 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 475728776, now seen corresponding path program 1 times [2024-10-14 20:57:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015178797] [2024-10-14 20:57:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:57:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:57:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 20:57:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-14 20:57:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015178797] [2024-10-14 20:57:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015178797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068236246] [2024-10-14 20:57:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:09,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:09,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:09,541 INFO L229 MonitoredProcess]: Starting monitored process 18 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:57:09,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-14 20:57:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:09,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:57:09,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 78 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 20:57:09,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 20:57:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068236246] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:09,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2024-10-14 20:57:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726479202] [2024-10-14 20:57:09,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:09,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 20:57:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 20:57:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:57:09,800 INFO L87 Difference]: Start difference. First operand 1546 states and 1748 transitions. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-14 20:57:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:10,264 INFO L93 Difference]: Finished difference Result 2412 states and 2761 transitions. [2024-10-14 20:57:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 20:57:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 102 [2024-10-14 20:57:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:10,271 INFO L225 Difference]: With dead ends: 2412 [2024-10-14 20:57:10,271 INFO L226 Difference]: Without dead ends: 1935 [2024-10-14 20:57:10,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-10-14 20:57:10,275 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:10,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 259 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:57:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2024-10-14 20:57:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1651. [2024-10-14 20:57:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1561 states have (on average 1.0928891736066624) internal successors, (1706), 1566 states have internal predecessors, (1706), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-14 20:57:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 1864 transitions. [2024-10-14 20:57:10,362 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 1864 transitions. Word has length 102 [2024-10-14 20:57:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:10,363 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 1864 transitions. [2024-10-14 20:57:10,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-14 20:57:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1864 transitions. [2024-10-14 20:57:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 20:57:10,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:10,364 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:10,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-14 20:57:10,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:10,565 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1669053778, now seen corresponding path program 1 times [2024-10-14 20:57:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175833419] [2024-10-14 20:57:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:57:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:57:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 20:57:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:57:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175833419] [2024-10-14 20:57:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175833419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530384080] [2024-10-14 20:57:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:10,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:10,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:10,694 INFO L229 MonitoredProcess]: Starting monitored process 19 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:57:10,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-14 20:57:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:10,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:57:10,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:57:10,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:57:10,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530384080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:10,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:10,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-14 20:57:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392868614] [2024-10-14 20:57:10,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:10,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 20:57:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 20:57:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:57:10,993 INFO L87 Difference]: Start difference. First operand 1651 states and 1864 transitions. Second operand has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-14 20:57:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:11,240 INFO L93 Difference]: Finished difference Result 2400 states and 2755 transitions. [2024-10-14 20:57:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:57:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 102 [2024-10-14 20:57:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:11,249 INFO L225 Difference]: With dead ends: 2400 [2024-10-14 20:57:11,249 INFO L226 Difference]: Without dead ends: 2399 [2024-10-14 20:57:11,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:57:11,251 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 125 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:11,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:57:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-14 20:57:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2351. [2024-10-14 20:57:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2351 states, 2224 states have (on average 1.110611510791367) internal successors, (2470), 2229 states have internal predecessors, (2470), 116 states have call successors, (116), 5 states have call predecessors, (116), 5 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-14 20:57:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 2702 transitions. [2024-10-14 20:57:11,394 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 2702 transitions. Word has length 102 [2024-10-14 20:57:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 2351 states and 2702 transitions. [2024-10-14 20:57:11,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-14 20:57:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2702 transitions. [2024-10-14 20:57:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 20:57:11,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:11,396 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:11,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-14 20:57:11,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:11,598 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 952620954, now seen corresponding path program 1 times [2024-10-14 20:57:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299964878] [2024-10-14 20:57:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:57:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:57:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 20:57:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 20:57:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 58 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 20:57:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299964878] [2024-10-14 20:57:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299964878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435275809] [2024-10-14 20:57:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:11,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:11,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:11,753 INFO L229 MonitoredProcess]: Starting monitored process 20 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:57:11,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-14 20:57:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:11,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:57:11,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 20:57:12,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 20:57:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435275809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:12,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-14 20:57:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467377805] [2024-10-14 20:57:12,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 20:57:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 20:57:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:57:12,161 INFO L87 Difference]: Start difference. First operand 2351 states and 2702 transitions. Second operand has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-14 20:57:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:12,697 INFO L93 Difference]: Finished difference Result 4572 states and 5354 transitions. [2024-10-14 20:57:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 20:57:12,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 133 [2024-10-14 20:57:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:12,709 INFO L225 Difference]: With dead ends: 4572 [2024-10-14 20:57:12,709 INFO L226 Difference]: Without dead ends: 3457 [2024-10-14 20:57:12,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 271 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:57:12,714 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:12,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 497 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:57:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2024-10-14 20:57:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 2619. [2024-10-14 20:57:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 2478 states have (on average 1.1073446327683616) internal successors, (2744), 2483 states have internal predecessors, (2744), 130 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-14 20:57:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3004 transitions. [2024-10-14 20:57:12,882 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3004 transitions. Word has length 133 [2024-10-14 20:57:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:12,885 INFO L471 AbstractCegarLoop]: Abstraction has 2619 states and 3004 transitions. [2024-10-14 20:57:12,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-14 20:57:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3004 transitions. [2024-10-14 20:57:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 20:57:12,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:57:12,889 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:12,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-14 20:57:13,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:13,093 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:57:13,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:57:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash -159059269, now seen corresponding path program 2 times [2024-10-14 20:57:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:57:13,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933713750] [2024-10-14 20:57:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:57:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:57:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:57:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:57:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:57:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:57:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:57:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 20:57:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 20:57:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 20:57:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:57:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 20:57:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:57:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933713750] [2024-10-14 20:57:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933713750] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:57:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526130135] [2024-10-14 20:57:13,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:57:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:57:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:57:13,386 INFO L229 MonitoredProcess]: Starting monitored process 21 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:57:13,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-14 20:57:13,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:57:13,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:57:13,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 20:57:13,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:57:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 332 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:57:13,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:57:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 272 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 20:57:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526130135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:57:13,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:57:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2024-10-14 20:57:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912934471] [2024-10-14 20:57:13,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:57:13,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 20:57:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:57:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 20:57:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-14 20:57:13,803 INFO L87 Difference]: Start difference. First operand 2619 states and 3004 transitions. Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-14 20:57:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:57:14,010 INFO L93 Difference]: Finished difference Result 2627 states and 3010 transitions. [2024-10-14 20:57:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 20:57:14,011 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 156 [2024-10-14 20:57:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:57:14,012 INFO L225 Difference]: With dead ends: 2627 [2024-10-14 20:57:14,012 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:57:14,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 314 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2024-10-14 20:57:14,015 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 55 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:57:14,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 744 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:57:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:57:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:57:14,017 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:57:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:57:14,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2024-10-14 20:57:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:57:14,018 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:57:14,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-14 20:57:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:57:14,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:57:14,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-14 20:57:14,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-14 20:57:14,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-14 20:57:14,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-14 20:57:14,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-14 20:57:14,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-14 20:57:14,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-14 20:57:14,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-14 20:57:14,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-14 20:57:14,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-14 20:57:14,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-14 20:57:14,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-14 20:57:14,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-14 20:57:14,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-14 20:57:14,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-14 20:57:14,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-14 20:57:14,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-14 20:57:14,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-14 20:57:14,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-14 20:57:14,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-14 20:57:14,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-14 20:57:14,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-14 20:57:14,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-14 20:57:14,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 20:57:14,229 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:57:14,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:57:17,673 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:57:17,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:57:17 BoogieIcfgContainer [2024-10-14 20:57:17,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:57:17,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:57:17,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:57:17,739 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:57:17,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:54" (3/4) ... [2024-10-14 20:57:17,741 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:57:17,745 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 20:57:17,745 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:57:17,750 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 20:57:17,750 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:57:17,750 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:57:17,750 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:57:17,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:57:17,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:57:17,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:57:17,851 INFO L158 Benchmark]: Toolchain (without parser) took 24296.21ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 112.2MB in the beginning and 192.0MB in the end (delta: -79.8MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,852 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 186.6MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:57:17,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.51ms. Allocated memory is still 186.6MB. Free memory was 112.0MB in the beginning and 152.7MB in the end (delta: -40.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.51ms. Allocated memory is still 186.6MB. Free memory was 152.7MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,852 INFO L158 Benchmark]: Boogie Preprocessor took 47.57ms. Allocated memory is still 186.6MB. Free memory was 150.6MB in the beginning and 149.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,853 INFO L158 Benchmark]: RCFGBuilder took 404.05ms. Allocated memory is still 186.6MB. Free memory was 149.6MB in the beginning and 152.4MB in the end (delta: -2.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,853 INFO L158 Benchmark]: TraceAbstraction took 23437.88ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 151.3MB in the beginning and 197.2MB in the end (delta: -45.9MB). Peak memory consumption was 198.0MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,853 INFO L158 Benchmark]: Witness Printer took 111.24ms. Allocated memory is still 325.1MB. Free memory was 197.2MB in the beginning and 192.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:57:17,854 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.96ms. Allocated memory is still 186.6MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.51ms. Allocated memory is still 186.6MB. Free memory was 112.0MB in the beginning and 152.7MB in the end (delta: -40.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.51ms. Allocated memory is still 186.6MB. Free memory was 152.7MB in the beginning and 150.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.57ms. Allocated memory is still 186.6MB. Free memory was 150.6MB in the beginning and 149.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 404.05ms. Allocated memory is still 186.6MB. Free memory was 149.6MB in the beginning and 152.4MB in the end (delta: -2.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23437.88ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 151.3MB in the beginning and 197.2MB in the end (delta: -45.9MB). Peak memory consumption was 198.0MB. Max. memory is 16.1GB. * Witness Printer took 111.24ms. Allocated memory is still 325.1MB. Free memory was 197.2MB in the beginning and 192.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 64 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2107 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2095 mSDsluCounter, 4819 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3553 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3878 IncrementalHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1266 mSDtfsCounter, 3878 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2431 GetRequests, 2134 SyntacticMatches, 25 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2619occurred in iteration=25, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 1431 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2518 NumberOfCodeBlocks, 2518 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3123 ConstructedInterpolants, 7 QuantifiedInterpolants, 10879 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2456 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 51 InterpolantComputations, 12 PerfectInterpolantSequences, 1891/3276 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 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= x1) && (2 <= counter)) && (2 <= x2)) && (y2 == 0)) && (counter <= 3)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) 2 + y3))) && (x2 <= 1073741823)) && (0 <= y3)) || ((((((((((0 <= x1) && (y2 == 0)) && (y1 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (counter <= 5)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || ((((((((((((0 <= x1) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (y2 == 0)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 4)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (x2 == 1)) && (counter <= 4)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (y3 <= 2147483644)) && (3 <= counter)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 == y2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483645)) && (x1 <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (x2 <= 2147483647)) && (counter == 5)) && (2 <= y2)) && (y1 == 0)) && (y2 <= 2147483646)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y1 == 1)) && (3 <= x2)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((((0 <= x1) && (y2 == 0)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == x2)) && (y1 == 1)) && (counter <= 4)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (y3 <= 2147483644)) && (3 <= counter)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) y3 + 1))) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 3)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 <= 2147483647)) && (x1 <= ((long long) y3 + 1))) && (y2 == 1)) && (y1 == 0)) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (1 <= x2)) && (y2 == 1)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (y2 <= 2147483644)) && (2 <= x2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y1 == 1)) && (2 <= y2)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || ((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (y1 == 1)) && (y2 == 1)) && (3 <= x2)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((((0 <= x1) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (1 <= x2)) && (y2 == 1)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (x2 == 1)) && (2 == y2)) && (y3 <= 2147483643)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y2)) && (x2 <= 2147483647)) && (counter <= 3)) && (y1 == 0)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y1)) && (x2 == 1)) && (y2 == 0)) && (counter <= 3)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (y2 <= 2147483644)) && (x2 == 1)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (2 <= y2)) && (x1 <= 2147483647)) && (((long long) y2 + y3) <= 2147483645)) && (0 <= y3))) || ((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 0)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (y1 <= 2147483644)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (y2 == 0)) && (x1 <= y3)) && (y1 == 0)) && (counter == 0))) || ((((((((((0 <= x1) && (x2 <= 2147483647)) && (counter == 4)) && (2 <= y2)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) 2147483645 + y3))) && (x1 <= 2147483647)) && (y2 <= 2147483645)) && (0 <= y3))) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((cond != 0) && (counter == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (((((cond != 0) || (counter < 4)) || (5 < counter)) && (((cond != 0) || (counter < 2)) || (3 < counter))) && ((cond != 0) || (counter != 1))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:57:17,882 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