./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/ps5-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:08:28,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:08:28,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:08:28,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:08:28,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:08:28,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:08:28,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:08:28,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:08:28,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:08:28,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:08:28,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:08:28,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:08:28,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:08:28,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:08:28,146 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:08:28,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:08:28,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:08:28,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:08:28,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:08:28,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:08:28,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:08:28,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:08:28,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:08:28,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:08:28,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:08:28,151 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:08:28,152 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:08:28,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:08:28,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:08:28,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:08:28,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:08:28,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:08:28,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:08:28,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:08:28,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:08:28,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:08:28,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:08:28,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:08:28,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:08:28,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:08:28,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:08:28,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:08:28,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:08:28,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:08:28,156 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-clean/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-clean/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 -> bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 [2024-10-11 21:08:28,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:08:28,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:08:28,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:08:28,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:08:28,429 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:08:28,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2024-10-11 21:08:29,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:08:30,078 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:08:30,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2024-10-11 21:08:30,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/026696ddf/8eba578258974a31a42cc98bdb1020ed/FLAG6d5689b2e [2024-10-11 21:08:30,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/026696ddf/8eba578258974a31a42cc98bdb1020ed [2024-10-11 21:08:30,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:08:30,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:08:30,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:08:30,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:08:30,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:08:30,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3ed17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30, skipping insertion in model container [2024-10-11 21:08:30,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:08:30,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:08:30,705 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:08:30,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:08:30,757 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:08:30,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30 WrapperNode [2024-10-11 21:08:30,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:08:30,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:08:30,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:08:30,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:08:30,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,818 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-10-11 21:08:30,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:08:30,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:08:30,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:08:30,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:08:30,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,845 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-11 21:08:30,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:08:30,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:08:30,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:08:30,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:08:30,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (1/1) ... [2024-10-11 21:08:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:08:30,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:08:30,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:08:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:08:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:08:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 21:08:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 21:08:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:08:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:08:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:08:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:08:30,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:08:31,015 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:08:31,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:08:31,471 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-11 21:08:31,471 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:08:31,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:08:31,514 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:08:31,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:08:31 BoogieIcfgContainer [2024-10-11 21:08:31,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:08:31,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:08:31,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:08:31,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:08:31,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:08:30" (1/3) ... [2024-10-11 21:08:31,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c02064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:08:31, skipping insertion in model container [2024-10-11 21:08:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:08:30" (2/3) ... [2024-10-11 21:08:31,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c02064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:08:31, skipping insertion in model container [2024-10-11 21:08:31,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:08:31" (3/3) ... [2024-10-11 21:08:31,526 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound1.c [2024-10-11 21:08:31,541 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:08:31,542 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2024-10-11 21:08:31,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:08:31,604 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;@1487bd44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:08:31,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2024-10-11 21:08:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:08:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:08:31,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:31,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:31,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:31,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1162004414, now seen corresponding path program 1 times [2024-10-11 21:08:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:31,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352126748] [2024-10-11 21:08:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:31,796 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-11 21:08:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352126748] [2024-10-11 21:08:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352126748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:08:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453611646] [2024-10-11 21:08:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:08:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:08:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:08:31,830 INFO L87 Difference]: Start difference. First operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-11 21:08:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:31,870 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2024-10-11 21:08:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:08:31,872 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-11 21:08:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:31,879 INFO L225 Difference]: With dead ends: 359 [2024-10-11 21:08:31,879 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 21:08:31,882 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-11 21:08:31,885 INFO L432 NwaCegarLoop]: 175 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, 175 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-11 21:08:31,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:08:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 21:08:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-11 21:08:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 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-11 21:08:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2024-10-11 21:08:31,931 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2024-10-11 21:08:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:31,932 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2024-10-11 21:08:31,932 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-11 21:08:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2024-10-11 21:08:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:08:31,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:31,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:08:31,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1920324093, now seen corresponding path program 1 times [2024-10-11 21:08:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106825750] [2024-10-11 21:08:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:31,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,052 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-11 21:08:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106825750] [2024-10-11 21:08:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106825750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:32,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:32,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:08:32,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844170619] [2024-10-11 21:08:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:32,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:08:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:32,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:08:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:32,061 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11 21:08:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:32,512 INFO L93 Difference]: Finished difference Result 308 states and 320 transitions. [2024-10-11 21:08:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:08:32,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11 21:08:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:32,515 INFO L225 Difference]: With dead ends: 308 [2024-10-11 21:08:32,515 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 21:08:32,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:32,517 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:32,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 124 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:08:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 21:08:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-10-11 21:08:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 168 states have (on average 1.505952380952381) internal successors, (253), 238 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:08:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 263 transitions. [2024-10-11 21:08:32,532 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 263 transitions. Word has length 14 [2024-10-11 21:08:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 263 transitions. [2024-10-11 21:08:32,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11 21:08:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 263 transitions. [2024-10-11 21:08:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 21:08:32,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:32,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:08:32,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:32,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1713492121, now seen corresponding path program 1 times [2024-10-11 21:08:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:32,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178216760] [2024-10-11 21:08:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:32,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,696 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-11 21:08:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178216760] [2024-10-11 21:08:32,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178216760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:32,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:32,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:08:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460137814] [2024-10-11 21:08:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:32,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:08:32,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:08:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:32,702 INFO L87 Difference]: Start difference. First operand 246 states and 263 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-11 21:08:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:32,791 INFO L93 Difference]: Finished difference Result 265 states and 277 transitions. [2024-10-11 21:08:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:08:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 42 [2024-10-11 21:08:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:32,793 INFO L225 Difference]: With dead ends: 265 [2024-10-11 21:08:32,793 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 21:08:32,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:32,795 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:32,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 293 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:08:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 21:08:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2024-10-11 21:08:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 245 states have internal predecessors, (260), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:08:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 270 transitions. [2024-10-11 21:08:32,808 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 270 transitions. Word has length 42 [2024-10-11 21:08:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:32,808 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 270 transitions. [2024-10-11 21:08:32,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-11 21:08:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2024-10-11 21:08:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 21:08:32,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:32,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:32,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:08:32,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:32,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1693457243, now seen corresponding path program 1 times [2024-10-11 21:08:32,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:32,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49472350] [2024-10-11 21:08:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:32,953 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-11 21:08:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49472350] [2024-10-11 21:08:32,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49472350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:32,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:32,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:08:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790276814] [2024-10-11 21:08:32,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:32,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:08:32,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:08:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:08:32,959 INFO L87 Difference]: Start difference. First operand 253 states and 270 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-11 21:08:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:33,140 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2024-10-11 21:08:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:08:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 44 [2024-10-11 21:08:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:33,142 INFO L225 Difference]: With dead ends: 264 [2024-10-11 21:08:33,142 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 21:08:33,143 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-11 21:08:33,144 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:33,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 230 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:08:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 21:08:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2024-10-11 21:08:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.457142857142857) internal successors, (255), 245 states have internal predecessors, (255), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:08:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2024-10-11 21:08:33,158 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 44 [2024-10-11 21:08:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:33,159 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2024-10-11 21:08:33,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-11 21:08:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2024-10-11 21:08:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 21:08:33,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:33,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:33,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:08:33,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:33,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash 957567089, now seen corresponding path program 1 times [2024-10-11 21:08:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423931333] [2024-10-11 21:08:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,259 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-11 21:08:33,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:33,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423931333] [2024-10-11 21:08:33,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423931333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:33,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:08:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885317144] [2024-10-11 21:08:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:33,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:08:33,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:33,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:08:33,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:08:33,263 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-11 21:08:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:33,662 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2024-10-11 21:08:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:08:33,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 45 [2024-10-11 21:08:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:33,663 INFO L225 Difference]: With dead ends: 263 [2024-10-11 21:08:33,664 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 21:08:33,664 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-11 21:08:33,665 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:33,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 264 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:08:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 21:08:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-10-11 21:08:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 211 states have internal predecessors, (217), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:08:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 227 transitions. [2024-10-11 21:08:33,681 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 227 transitions. Word has length 45 [2024-10-11 21:08:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:33,681 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 227 transitions. [2024-10-11 21:08:33,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-11 21:08:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 227 transitions. [2024-10-11 21:08:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:08:33,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:33,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:33,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:08:33,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:33,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash -280525862, now seen corresponding path program 1 times [2024-10-11 21:08:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001841297] [2024-10-11 21:08:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:08:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,785 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-11 21:08:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001841297] [2024-10-11 21:08:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001841297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:33,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:08:33,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161917553] [2024-10-11 21:08:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:33,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:08:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:08:33,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:33,787 INFO L87 Difference]: Start difference. First operand 219 states and 227 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-11 21:08:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:33,812 INFO L93 Difference]: Finished difference Result 221 states and 227 transitions. [2024-10-11 21:08:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:08:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 54 [2024-10-11 21:08:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:33,814 INFO L225 Difference]: With dead ends: 221 [2024-10-11 21:08:33,815 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 21:08:33,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:33,817 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 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-11 21:08:33,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:08:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 21:08:33,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-11 21:08:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.524822695035461) internal successors, (215), 211 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:08:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 225 transitions. [2024-10-11 21:08:33,836 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 225 transitions. Word has length 54 [2024-10-11 21:08:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:33,836 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 225 transitions. [2024-10-11 21:08:33,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-11 21:08:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 225 transitions. [2024-10-11 21:08:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:08:33,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:33,839 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:33,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:08:33,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:33,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1964749084, now seen corresponding path program 1 times [2024-10-11 21:08:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:33,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380376983] [2024-10-11 21:08:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:33,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:08:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851947573] [2024-10-11 21:08:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:08:33,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:08:33,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:08:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:33,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:08:33,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:08:34,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-11 21:08:34,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:08:34,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380376983] [2024-10-11 21:08:34,044 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:08:34,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851947573] [2024-10-11 21:08:34,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851947573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:34,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:34,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:08:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455582211] [2024-10-11 21:08:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:34,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:08:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:08:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:08:34,046 INFO L87 Difference]: Start difference. First operand 219 states and 225 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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-11 21:08:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:34,430 INFO L93 Difference]: Finished difference Result 358 states and 374 transitions. [2024-10-11 21:08:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:08:34,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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 59 [2024-10-11 21:08:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:34,433 INFO L225 Difference]: With dead ends: 358 [2024-10-11 21:08:34,433 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 21:08:34,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:08:34,435 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:34,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:08:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 21:08:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2024-10-11 21:08:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.4036697247706422) internal successors, (306), 288 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:08:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 320 transitions. [2024-10-11 21:08:34,444 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 320 transitions. Word has length 59 [2024-10-11 21:08:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:34,444 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 320 transitions. [2024-10-11 21:08:34,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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-11 21:08:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 320 transitions. [2024-10-11 21:08:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 21:08:34,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:34,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:34,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:08:34,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:34,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:34,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash -69304982, now seen corresponding path program 1 times [2024-10-11 21:08:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409984558] [2024-10-11 21:08:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:34,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:08:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:08:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:08:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:34,746 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-11 21:08:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409984558] [2024-10-11 21:08:34,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409984558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:34,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:34,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:08:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041770412] [2024-10-11 21:08:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:08:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:34,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:08:34,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:08:34,749 INFO L87 Difference]: Start difference. First operand 298 states and 320 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-11 21:08:38,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:08:43,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:08:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:43,047 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2024-10-11 21:08:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:08:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 65 [2024-10-11 21:08:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:43,050 INFO L225 Difference]: With dead ends: 299 [2024-10-11 21:08:43,050 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 21:08:43,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11 21:08:43,051 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 39 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:43,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 298 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-10-11 21:08:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 21:08:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-11 21:08:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.3990825688073394) internal successors, (305), 288 states have internal predecessors, (305), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:08:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 319 transitions. [2024-10-11 21:08:43,062 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 319 transitions. Word has length 65 [2024-10-11 21:08:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:43,063 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 319 transitions. [2024-10-11 21:08:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-11 21:08:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 319 transitions. [2024-10-11 21:08:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 21:08:43,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:43,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:43,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:08:43,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:43,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1220812152, now seen corresponding path program 1 times [2024-10-11 21:08:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181311235] [2024-10-11 21:08:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:08:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120717058] [2024-10-11 21:08:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:43,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:43,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:08:43,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:08:43,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:08:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:43,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:08:43,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:08:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:08:43,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:08:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181311235] [2024-10-11 21:08:43,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:08:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120717058] [2024-10-11 21:08:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120717058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:08:43,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:08:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:08:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200587453] [2024-10-11 21:08:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:08:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:08:43,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:43,312 INFO L87 Difference]: Start difference. First operand 298 states and 319 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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-11 21:08:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:44,554 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2024-10-11 21:08:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:08:44,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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 95 [2024-10-11 21:08:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:44,556 INFO L225 Difference]: With dead ends: 298 [2024-10-11 21:08:44,556 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 21:08:44,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:08:44,557 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:44,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 156 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 21:08:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 21:08:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-11 21:08:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 285 states have internal predecessors, (300), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:08:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 314 transitions. [2024-10-11 21:08:44,571 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 314 transitions. Word has length 95 [2024-10-11 21:08:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 314 transitions. [2024-10-11 21:08:44,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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-11 21:08:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 314 transitions. [2024-10-11 21:08:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 21:08:44,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:44,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:44,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:08:44,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:44,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:44,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 809529056, now seen corresponding path program 1 times [2024-10-11 21:08:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:44,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106208147] [2024-10-11 21:08:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:08:44,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439044994] [2024-10-11 21:08:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:44,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:44,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:08:44,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:08:44,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:08:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:44,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:08:44,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:08:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:08:45,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:08:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:08:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106208147] [2024-10-11 21:08:45,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:08:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439044994] [2024-10-11 21:08:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439044994] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:08:45,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:08:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 21:08:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74495889] [2024-10-11 21:08:45,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:08:45,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:08:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:08:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:08:45,418 INFO L87 Difference]: Start difference. First operand 295 states and 314 transitions. Second operand has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 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-11 21:08:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:08:46,262 INFO L93 Difference]: Finished difference Result 367 states and 382 transitions. [2024-10-11 21:08:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:08:46,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 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 96 [2024-10-11 21:08:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:08:46,265 INFO L225 Difference]: With dead ends: 367 [2024-10-11 21:08:46,266 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 21:08:46,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:08:46,271 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 284 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 21:08:46,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 300 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 21:08:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 21:08:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 333. [2024-10-11 21:08:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 257 states have (on average 1.3968871595330739) internal successors, (359), 323 states have internal predecessors, (359), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:08:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2024-10-11 21:08:46,283 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 96 [2024-10-11 21:08:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:08:46,283 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2024-10-11 21:08:46,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 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-11 21:08:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2024-10-11 21:08:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 21:08:46,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:08:46,285 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:08:46,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:08:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:46,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:08:46,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:08:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -674402934, now seen corresponding path program 1 times [2024-10-11 21:08:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:08:46,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327737040] [2024-10-11 21:08:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:08:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:08:46,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692156190] [2024-10-11 21:08:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:08:46,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:08:46,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:08:46,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:08:46,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:08:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:08:46,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 21:08:46,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:08:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:08:46,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:08:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:08:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:08:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327737040] [2024-10-11 21:08:49,465 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:08:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692156190] [2024-10-11 21:08:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692156190] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 21:08:49,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:08:49,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-10-11 21:08:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077644386] [2024-10-11 21:08:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:08:49,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:08:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:08:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:08:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:08:49,468 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-11 21:08:53,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:08:58,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:02,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:04,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:08,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:12,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:17,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:19,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:21,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:24,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:26,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:28,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:32,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:32,920 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2024-10-11 21:09:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:09:32,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 97 [2024-10-11 21:09:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:32,922 INFO L225 Difference]: With dead ends: 333 [2024-10-11 21:09:32,922 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 21:09:32,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:09:32,923 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 147 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:32,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 66 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 43.4s Time] [2024-10-11 21:09:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 21:09:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-10-11 21:09:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 257 states have (on average 1.3813229571984436) internal successors, (355), 321 states have internal predecessors, (355), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:09:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 369 transitions. [2024-10-11 21:09:32,936 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 369 transitions. Word has length 97 [2024-10-11 21:09:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:32,936 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 369 transitions. [2024-10-11 21:09:32,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-11 21:09:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 369 transitions. [2024-10-11 21:09:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 21:09:32,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:32,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:32,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:09:33,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:09:33,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:33,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash 568345634, now seen corresponding path program 1 times [2024-10-11 21:09:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188854105] [2024-10-11 21:09:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963481337] [2024-10-11 21:09:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:33,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:33,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:09:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:33,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:09:33,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:33,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:09:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188854105] [2024-10-11 21:09:33,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963481337] [2024-10-11 21:09:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963481337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:09:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625558813] [2024-10-11 21:09:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:33,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:09:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:33,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:09:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:09:33,399 INFO L87 Difference]: Start difference. First operand 331 states and 369 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-11 21:09:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:33,904 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2024-10-11 21:09:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:09:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 98 [2024-10-11 21:09:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:33,906 INFO L225 Difference]: With dead ends: 331 [2024-10-11 21:09:33,906 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 21:09:33,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:09:33,907 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:33,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 69 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:09:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 21:09:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-11 21:09:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 257 states have (on average 1.264591439688716) internal successors, (325), 301 states have internal predecessors, (325), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:09:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 339 transitions. [2024-10-11 21:09:33,918 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 339 transitions. Word has length 98 [2024-10-11 21:09:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:33,919 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 339 transitions. [2024-10-11 21:09:33,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-11 21:09:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 339 transitions. [2024-10-11 21:09:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 21:09:33,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:33,920 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:33,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:09:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:09:34,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:34,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:34,121 INFO L85 PathProgramCache]: Analyzing trace with hash 438845580, now seen corresponding path program 1 times [2024-10-11 21:09:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321453038] [2024-10-11 21:09:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:34,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632127999] [2024-10-11 21:09:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:34,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:34,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:09:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:34,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:09:34,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:09:34,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 21:09:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321453038] [2024-10-11 21:09:34,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632127999] [2024-10-11 21:09:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632127999] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 21:09:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869097938] [2024-10-11 21:09:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:09:34,777 INFO L87 Difference]: Start difference. First operand 311 states and 339 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-11 21:09:39,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:09:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:40,474 INFO L93 Difference]: Finished difference Result 311 states and 339 transitions. [2024-10-11 21:09:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:40,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 99 [2024-10-11 21:09:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:40,476 INFO L225 Difference]: With dead ends: 311 [2024-10-11 21:09:40,476 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 21:09:40,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:09:40,477 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:40,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 21:09:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 21:09:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-11 21:09:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 299 states have internal predecessors, (321), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:09:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 335 transitions. [2024-10-11 21:09:40,491 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 335 transitions. Word has length 99 [2024-10-11 21:09:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:40,492 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 335 transitions. [2024-10-11 21:09:40,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-11 21:09:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 335 transitions. [2024-10-11 21:09:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 21:09:40,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:40,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:40,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:09:40,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:09:40,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:40,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash -920443063, now seen corresponding path program 1 times [2024-10-11 21:09:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012852215] [2024-10-11 21:09:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:40,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:09:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:09:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:09:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:09:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:09:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012852215] [2024-10-11 21:09:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012852215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66797701] [2024-10-11 21:09:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:40,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:40,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:40,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:09:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:40,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:09:40,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:09:41,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:09:41,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66797701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:41,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:41,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 21:09:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517471096] [2024-10-11 21:09:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:41,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:41,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:09:41,052 INFO L87 Difference]: Start difference. First operand 309 states and 335 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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-11 21:09:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:41,081 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2024-10-11 21:09:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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 107 [2024-10-11 21:09:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:41,083 INFO L225 Difference]: With dead ends: 309 [2024-10-11 21:09:41,083 INFO L226 Difference]: Without dead ends: 308 [2024-10-11 21:09:41,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-11 21:09:41,084 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:41,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 346 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-11 21:09:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-11 21:09:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 298 states have internal predecessors, (319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:09:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 333 transitions. [2024-10-11 21:09:41,098 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 333 transitions. Word has length 107 [2024-10-11 21:09:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:41,098 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 333 transitions. [2024-10-11 21:09:41,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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-11 21:09:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 333 transitions. [2024-10-11 21:09:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 21:09:41,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:41,100 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:41,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:09:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:41,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1531036241, now seen corresponding path program 1 times [2024-10-11 21:09:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259423552] [2024-10-11 21:09:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:09:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:41,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:09:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:41,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:09:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:09:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:09:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:41,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259423552] [2024-10-11 21:09:41,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259423552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:41,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756612364] [2024-10-11 21:09:41,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:41,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:41,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:41,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:41,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:09:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:41,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:09:41,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:09:41,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:09:41,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756612364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:09:41,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:09:41,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 21:09:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452611105] [2024-10-11 21:09:41,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:41,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:09:41,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:41,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:09:41,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:09:41,662 INFO L87 Difference]: Start difference. First operand 308 states and 333 transitions. Second operand has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 21:09:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:41,711 INFO L93 Difference]: Finished difference Result 407 states and 420 transitions. [2024-10-11 21:09:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:09:41,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 108 [2024-10-11 21:09:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:41,713 INFO L225 Difference]: With dead ends: 407 [2024-10-11 21:09:41,714 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 21:09:41,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:09:41,715 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 68 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:41,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 21:09:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 365. [2024-10-11 21:09:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 353 states have internal predecessors, (399), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:09:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 417 transitions. [2024-10-11 21:09:41,756 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 417 transitions. Word has length 108 [2024-10-11 21:09:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 417 transitions. [2024-10-11 21:09:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 21:09:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 417 transitions. [2024-10-11 21:09:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 21:09:41,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:41,758 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:41,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 21:09:41,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 21:09:41,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -423331491, now seen corresponding path program 1 times [2024-10-11 21:09:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520342139] [2024-10-11 21:09:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:09:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:09:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:09:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:09:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:09:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520342139] [2024-10-11 21:09:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520342139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:09:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354856324] [2024-10-11 21:09:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:42,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:42,042 INFO L87 Difference]: Start difference. First operand 365 states and 417 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 21:09:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:42,279 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2024-10-11 21:09:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:09:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2024-10-11 21:09:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:42,282 INFO L225 Difference]: With dead ends: 365 [2024-10-11 21:09:42,283 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 21:09:42,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-11 21:09:42,284 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:42,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 38 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:09:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 21:09:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-10-11 21:09:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 312 states have (on average 1.233974358974359) internal successors, (385), 346 states have internal predecessors, (385), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:09:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-10-11 21:09:42,299 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 120 [2024-10-11 21:09:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:42,300 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-10-11 21:09:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 21:09:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-10-11 21:09:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 21:09:42,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:42,301 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:09:42,301 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:42,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -238374285, now seen corresponding path program 1 times [2024-10-11 21:09:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532007722] [2024-10-11 21:09:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:09:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:09:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:09:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:09:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:09:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532007722] [2024-10-11 21:09:42,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532007722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:09:42,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:09:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:09:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401814579] [2024-10-11 21:09:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:09:42,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:09:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:09:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:09:42,380 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 21:09:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:42,532 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2024-10-11 21:09:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:09:42,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2024-10-11 21:09:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:42,534 INFO L225 Difference]: With dead ends: 358 [2024-10-11 21:09:42,534 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 21:09:42,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-11 21:09:42,535 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:42,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 38 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:09:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 21:09:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-11 21:09:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 345 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:09:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 400 transitions. [2024-10-11 21:09:42,550 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 400 transitions. Word has length 121 [2024-10-11 21:09:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:42,551 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 400 transitions. [2024-10-11 21:09:42,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 21:09:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 400 transitions. [2024-10-11 21:09:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 21:09:42,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:42,552 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 21:09:42,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:42,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419595, now seen corresponding path program 1 times [2024-10-11 21:09:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691451266] [2024-10-11 21:09:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:42,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:09:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:09:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:09:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 21:09:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 21:09:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:42,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691451266] [2024-10-11 21:09:42,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691451266] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:42,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131832282] [2024-10-11 21:09:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:42,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:42,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:42,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:09:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:42,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:09:42,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 21:09:43,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 21:09:43,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131832282] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:09:43,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:09:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 21:09:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892451734] [2024-10-11 21:09:43,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:43,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 21:09:43,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:43,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 21:09:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:09:43,447 INFO L87 Difference]: Start difference. First operand 357 states and 400 transitions. Second operand has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 11 states have internal predecessors, (284), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 21:09:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:43,510 INFO L93 Difference]: Finished difference Result 365 states and 405 transitions. [2024-10-11 21:09:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:09:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 11 states have internal predecessors, (284), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 123 [2024-10-11 21:09:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:43,511 INFO L225 Difference]: With dead ends: 365 [2024-10-11 21:09:43,511 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 21:09:43,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 21:09:43,512 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 73 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:43,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 431 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:09:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 21:09:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2024-10-11 21:09:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.0078125) internal successors, (129), 129 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2024-10-11 21:09:43,520 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 123 [2024-10-11 21:09:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:43,520 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2024-10-11 21:09:43,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 11 states have internal predecessors, (284), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 21:09:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2024-10-11 21:09:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 21:09:43,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:43,522 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:43,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 21:09:43,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:09:43,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash -351277160, now seen corresponding path program 1 times [2024-10-11 21:09:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830107562] [2024-10-11 21:09:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46015527] [2024-10-11 21:09:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:43,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:43,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:43,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:09:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:43,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:09:43,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:09:44,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830107562] [2024-10-11 21:09:45,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46015527] [2024-10-11 21:09:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46015527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:45,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:45,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-11 21:09:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610220272] [2024-10-11 21:09:45,972 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:09:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:09:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:09:45,973 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 21:09:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:46,148 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2024-10-11 21:09:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:09:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2024-10-11 21:09:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:46,150 INFO L225 Difference]: With dead ends: 137 [2024-10-11 21:09:46,150 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 21:09:46,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:09:46,150 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:46,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 161 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:09:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 21:09:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 21:09:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.0) internal successors, (128), 128 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:09:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2024-10-11 21:09:46,158 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 146 [2024-10-11 21:09:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:46,158 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2024-10-11 21:09:46,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 21:09:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2024-10-11 21:09:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 21:09:46,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:09:46,160 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 21:09:46,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:46,361 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-11 21:09:46,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:09:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1995310146, now seen corresponding path program 1 times [2024-10-11 21:09:46,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:09:46,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166907087] [2024-10-11 21:09:46,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:46,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:09:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:09:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493578166] [2024-10-11 21:09:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:09:46,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:46,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:09:46,388 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:09:46,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:09:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:09:46,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:09:46,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:09:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:09:46,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:09:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:09:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166907087] [2024-10-11 21:09:49,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:09:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493578166] [2024-10-11 21:09:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493578166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:09:49,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:09:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-11 21:09:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328273188] [2024-10-11 21:09:49,220 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 21:09:49,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:09:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:09:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:09:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:09:49,221 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 21:09:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:09:49,426 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2024-10-11 21:09:49,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:09:49,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2024-10-11 21:09:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:09:49,427 INFO L225 Difference]: With dead ends: 136 [2024-10-11 21:09:49,427 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:09:49,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:09:49,428 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 18 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:09:49,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 189 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:09:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:09:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:09:49,428 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-11 21:09:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:09:49,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2024-10-11 21:09:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:09:49,429 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:09:49,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 21:09:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:09:49,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:09:49,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2024-10-11 21:09:49,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2024-10-11 21:09:49,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2024-10-11 21:09:49,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2024-10-11 21:09:49,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2024-10-11 21:09:49,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2024-10-11 21:09:49,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2024-10-11 21:09:49,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2024-10-11 21:09:49,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2024-10-11 21:09:49,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2024-10-11 21:09:49,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2024-10-11 21:09:49,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2024-10-11 21:09:49,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2024-10-11 21:09:49,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 21:09:49,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:09:49,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:09:49,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:09:49,710 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:09:49,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:09:49 BoogieIcfgContainer [2024-10-11 21:09:49,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:09:49,731 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:09:49,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:09:49,731 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:09:49,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:08:31" (3/4) ... [2024-10-11 21:09:49,733 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:09:49,737 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 21:09:49,737 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 21:09:49,744 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 21:09:49,744 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:09:49,744 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:09:49,744 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:09:49,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:09:49,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:09:49,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:09:49,855 INFO L158 Benchmark]: Toolchain (without parser) took 79374.49ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 110.6MB in the beginning and 68.1MB in the end (delta: 42.5MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,855 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:09:49,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.66ms. Allocated memory is still 165.7MB. Free memory was 110.2MB in the beginning and 137.8MB in the end (delta: -27.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.44ms. Allocated memory is still 165.7MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,856 INFO L158 Benchmark]: Boogie Preprocessor took 37.31ms. Allocated memory is still 165.7MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,856 INFO L158 Benchmark]: RCFGBuilder took 656.36ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 103.0MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,856 INFO L158 Benchmark]: TraceAbstraction took 78213.34ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 102.2MB in the beginning and 74.4MB in the end (delta: 27.8MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,857 INFO L158 Benchmark]: Witness Printer took 123.68ms. Allocated memory is still 199.2MB. Free memory was 74.4MB in the beginning and 68.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:09:49,859 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.97ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.66ms. Allocated memory is still 165.7MB. Free memory was 110.2MB in the beginning and 137.8MB in the end (delta: -27.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.44ms. Allocated memory is still 165.7MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.31ms. Allocated memory is still 165.7MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.36ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 103.0MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 78213.34ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 102.2MB in the beginning and 74.4MB in the end (delta: 27.8MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * Witness Printer took 123.68ms. Allocated memory is still 199.2MB. Free memory was 74.4MB in the beginning and 68.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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: 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: 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: 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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, 187 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 78.1s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 62.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1642 mSDsluCounter, 4230 SdHoareTripleChecker+Invalid, 61.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2308 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3965 IncrementalHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 1922 mSDtfsCounter, 3965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1904 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=15, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2869 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2527 ConstructedInterpolants, 0 QuantifiedInterpolants, 17247 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1702 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 582/985 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 84 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((k == 1) && (c == 1)) && (x == 1)) && (y == 1)) || (((((0 <= k) && (c == 0)) && (k <= 1)) && (y == 0)) && (x == 0))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:09:49,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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