./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:17:50,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:17:50,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:17:50,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:17:50,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:17:51,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:17:51,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:17:51,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:17:51,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:17:51,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:17:51,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:17:51,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:17:51,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:17:51,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:17:51,040 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:17:51,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:17:51,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:17:51,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:17:51,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:17:51,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:17:51,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:17:51,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:17:51,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:17:51,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:17:51,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:17:51,051 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:17:51,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:17:51,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:17:51,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:17:51,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:17:51,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:17:51,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:17:51,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:17:51,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:17:51,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:51,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:17:51,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:17:51,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:17:51,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:17:51,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:17:51,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:17:51,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:17:51,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:17:51,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:17:51,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2024-10-14 21:17:51,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:17:51,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:17:51,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:17:51,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:17:51,305 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:17:51,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2024-10-14 21:17:52,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:17:52,920 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:17:52,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2024-10-14 21:17:52,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd755044/754d55a7f4bf4ef78722488b9f4f3b4d/FLAGb94a6ebd3 [2024-10-14 21:17:53,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd755044/754d55a7f4bf4ef78722488b9f4f3b4d [2024-10-14 21:17:53,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:17:53,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:17:53,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:53,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:17:53,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:17:53,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2f549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53, skipping insertion in model container [2024-10-14 21:17:53,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:17:53,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:53,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:17:53,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:53,579 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:17:53,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53 WrapperNode [2024-10-14 21:17:53,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:53,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:53,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:17:53,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:17:53,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,634 INFO L138 Inliner]: procedures = 20, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2024-10-14 21:17:53,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:53,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:17:53,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:17:53,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:17:53,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,666 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-10-14 21:17:53,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:17:53,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:17:53,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:17:53,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:17:53,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (1/1) ... [2024-10-14 21:17:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:53,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:17:53,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:17:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:17:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:17:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:17:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:17:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 21:17:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 21:17:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 21:17:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:17:53,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:17:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 21:17:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 21:17:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 21:17:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:17:53,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:17:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 21:17:53,889 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:17:53,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:17:54,208 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-14 21:17:54,209 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:17:54,274 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:17:54,275 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 21:17:54,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:54 BoogieIcfgContainer [2024-10-14 21:17:54,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:17:54,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:17:54,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:17:54,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:17:54,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:17:53" (1/3) ... [2024-10-14 21:17:54,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da77948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:54, skipping insertion in model container [2024-10-14 21:17:54,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:53" (2/3) ... [2024-10-14 21:17:54,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da77948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:54, skipping insertion in model container [2024-10-14 21:17:54,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:54" (3/3) ... [2024-10-14 21:17:54,290 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-10-14 21:17:54,306 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:17:54,306 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-14 21:17:54,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:17:54,359 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;@6e55bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:17:54,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-14 21:17:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 40 states have (on average 1.75) internal successors, (70), 63 states have internal predecessors, (70), 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-14 21:17:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:17:54,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:54,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:54,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:54,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash -607891599, now seen corresponding path program 1 times [2024-10-14 21:17:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397259223] [2024-10-14 21:17:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397259223] [2024-10-14 21:17:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397259223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:54,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:17:54,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874035889] [2024-10-14 21:17:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:54,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 21:17:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 21:17:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:17:54,596 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.75) internal successors, (70), 63 states have internal predecessors, (70), 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-14 21:17:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:54,628 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2024-10-14 21:17:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 21:17:54,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 21:17:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:54,640 INFO L225 Difference]: With dead ends: 138 [2024-10-14 21:17:54,640 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 21:17:54,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:17:54,650 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:54,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 21:17:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 21:17:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.641025641025641) internal successors, (64), 60 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-10-14 21:17:54,689 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 14 [2024-10-14 21:17:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:54,689 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-10-14 21:17:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-10-14 21:17:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:17:54,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:54,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:17:54,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:54,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 95020021, now seen corresponding path program 1 times [2024-10-14 21:17:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372322858] [2024-10-14 21:17:54,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:54,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372322858] [2024-10-14 21:17:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372322858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:54,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:54,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072654134] [2024-10-14 21:17:54,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:54,943 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,061 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-10-14 21:17:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:55,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 21:17:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,066 INFO L225 Difference]: With dead ends: 82 [2024-10-14 21:17:55,066 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 21:17:55,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:17:55,069 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 63 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 143 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 21:17:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-10-14 21:17:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 68 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-10-14 21:17:55,084 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 14 [2024-10-14 21:17:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,086 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-10-14 21:17:55,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-10-14 21:17:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 21:17:55,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:55,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:17:55,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:55,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1349346599, now seen corresponding path program 1 times [2024-10-14 21:17:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6844899] [2024-10-14 21:17:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6844899] [2024-10-14 21:17:55,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6844899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:55,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:55,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:55,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334995115] [2024-10-14 21:17:55,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:55,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:55,205 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,284 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-10-14 21:17:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:55,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-10-14 21:17:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,286 INFO L225 Difference]: With dead ends: 82 [2024-10-14 21:17:55,287 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 21:17:55,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:17:55,289 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 145 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 21:17:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-14 21:17:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 69 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-10-14 21:17:55,300 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 15 [2024-10-14 21:17:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,300 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-10-14 21:17:55,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-10-14 21:17:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 21:17:55,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:55,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:17:55,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:55,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 358043323, now seen corresponding path program 1 times [2024-10-14 21:17:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774355183] [2024-10-14 21:17:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:55,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774355183] [2024-10-14 21:17:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774355183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056096720] [2024-10-14 21:17:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:55,443 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,530 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-10-14 21:17:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:55,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-14 21:17:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,532 INFO L225 Difference]: With dead ends: 82 [2024-10-14 21:17:55,535 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 21:17:55,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:17:55,536 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 56 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 147 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 21:17:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-10-14 21:17:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-10-14 21:17:55,549 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2024-10-14 21:17:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,550 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-10-14 21:17:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-10-14 21:17:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 21:17:55,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:55,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:17:55,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:55,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1785558822, now seen corresponding path program 1 times [2024-10-14 21:17:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601686944] [2024-10-14 21:17:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601686944] [2024-10-14 21:17:55,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601686944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:55,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:55,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711738278] [2024-10-14 21:17:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:55,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:55,661 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,725 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-14 21:17:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-14 21:17:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,729 INFO L225 Difference]: With dead ends: 82 [2024-10-14 21:17:55,729 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 21:17:55,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:17:55,731 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 149 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 21:17:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-14 21:17:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.54) internal successors, (77), 71 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-10-14 21:17:55,745 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 18 [2024-10-14 21:17:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,745 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-10-14 21:17:55,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-10-14 21:17:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 21:17:55,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:55,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:17:55,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:55,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2070629101, now seen corresponding path program 1 times [2024-10-14 21:17:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059287816] [2024-10-14 21:17:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:55,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059287816] [2024-10-14 21:17:55,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059287816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:55,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:55,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:55,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765613035] [2024-10-14 21:17:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:17:55,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:17:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:17:55,795 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:17:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,816 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2024-10-14 21:17:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:17:55,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-14 21:17:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,820 INFO L225 Difference]: With dead ends: 141 [2024-10-14 21:17:55,820 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 21:17:55,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:17:55,822 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 21:17:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 21:17:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 72 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-10-14 21:17:55,834 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 20 [2024-10-14 21:17:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,836 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-10-14 21:17:55,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:17:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-10-14 21:17:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 21:17:55,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,838 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] [2024-10-14 21:17:55,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 21:17:55,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:55,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1002855577, now seen corresponding path program 1 times [2024-10-14 21:17:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884241225] [2024-10-14 21:17:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:55,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884241225] [2024-10-14 21:17:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884241225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:55,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386770793] [2024-10-14 21:17:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:55,906 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:17:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:55,972 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-14 21:17:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2024-10-14 21:17:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:55,973 INFO L225 Difference]: With dead ends: 86 [2024-10-14 21:17:55,973 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 21:17:55,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:55,976 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:55,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 21:17:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-14 21:17:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 75 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-14 21:17:55,988 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 24 [2024-10-14 21:17:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:55,992 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-14 21:17:55,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:17:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-14 21:17:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 21:17:55,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:55,993 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:55,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 21:17:55,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:55,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1386963343, now seen corresponding path program 1 times [2024-10-14 21:17:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846076393] [2024-10-14 21:17:55,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:55,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 21:17:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846076393] [2024-10-14 21:17:56,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846076393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725071986] [2024-10-14 21:17:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:56,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:56,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:17:56,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:17:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:56,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:17:56,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:56,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725071986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:56,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:56,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2024-10-14 21:17:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606233326] [2024-10-14 21:17:56,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:56,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:17:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:17:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:56,559 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:56,670 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-14 21:17:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:17:56,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-10-14 21:17:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:56,673 INFO L225 Difference]: With dead ends: 82 [2024-10-14 21:17:56,673 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 21:17:56,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:56,675 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 41 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:56,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 203 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 21:17:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 21:17:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 74 states have internal predecessors, (81), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:17:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-14 21:17:56,686 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2024-10-14 21:17:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:56,687 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-14 21:17:56,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-14 21:17:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 21:17:56,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:56,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:56,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:17:56,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:56,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 46190764, now seen corresponding path program 1 times [2024-10-14 21:17:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276234490] [2024-10-14 21:17:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 21:17:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276234490] [2024-10-14 21:17:57,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276234490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:57,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:57,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 21:17:57,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570268278] [2024-10-14 21:17:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:57,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 21:17:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:57,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 21:17:57,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:17:57,070 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:57,241 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-10-14 21:17:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:17:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-10-14 21:17:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:57,243 INFO L225 Difference]: With dead ends: 96 [2024-10-14 21:17:57,243 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 21:17:57,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:57,244 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 53 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:57,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 216 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:17:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 21:17:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-14 21:17:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 82 states have internal predecessors, (92), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:17:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-10-14 21:17:57,255 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 27 [2024-10-14 21:17:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:57,255 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-10-14 21:17:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-10-14 21:17:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 21:17:57,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:57,256 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] [2024-10-14 21:17:57,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 21:17:57,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1671532669, now seen corresponding path program 1 times [2024-10-14 21:17:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306079933] [2024-10-14 21:17:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:57,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306079933] [2024-10-14 21:17:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306079933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:17:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677615910] [2024-10-14 21:17:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:57,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:57,318 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:17:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:57,349 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2024-10-14 21:17:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 26 [2024-10-14 21:17:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:57,352 INFO L225 Difference]: With dead ends: 173 [2024-10-14 21:17:57,353 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 21:17:57,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:57,354 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:57,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 21:17:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 21:17:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 86 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:17:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-14 21:17:57,365 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 26 [2024-10-14 21:17:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:57,365 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-14 21:17:57,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:17:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-14 21:17:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 21:17:57,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:57,366 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:57,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 21:17:57,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:57,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1431913777, now seen corresponding path program 1 times [2024-10-14 21:17:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398033120] [2024-10-14 21:17:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 21:17:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398033120] [2024-10-14 21:17:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398033120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34903238] [2024-10-14 21:17:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:57,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:57,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:17:57,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:17:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:57,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:17:57,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:57,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34903238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:57,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2024-10-14 21:17:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181626714] [2024-10-14 21:17:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:57,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:17:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:17:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:57,651 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:57,745 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-10-14 21:17:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:17:57,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2024-10-14 21:17:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:57,747 INFO L225 Difference]: With dead ends: 95 [2024-10-14 21:17:57,747 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 21:17:57,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:57,748 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 38 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:57,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 21:17:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 21:17:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 85 states have internal predecessors, (94), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:17:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-10-14 21:17:57,757 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 28 [2024-10-14 21:17:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:57,757 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-10-14 21:17:57,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-10-14 21:17:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 21:17:57,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:57,762 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] [2024-10-14 21:17:57,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:17:57,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 21:17:57,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:57,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1949928225, now seen corresponding path program 1 times [2024-10-14 21:17:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885981479] [2024-10-14 21:17:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885981479] [2024-10-14 21:17:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885981479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390746540] [2024-10-14 21:17:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:58,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:17:58,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:17:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:17:58,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:58,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390746540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-10-14 21:17:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987069045] [2024-10-14 21:17:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:58,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:58,258 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:58,361 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-10-14 21:17:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:17:58,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-14 21:17:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:58,363 INFO L225 Difference]: With dead ends: 94 [2024-10-14 21:17:58,363 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 21:17:58,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:58,364 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 42 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:58,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 181 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 21:17:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 21:17:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:17:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-10-14 21:17:58,373 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 28 [2024-10-14 21:17:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:58,373 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-10-14 21:17:58,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:17:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-10-14 21:17:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:17:58,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:58,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:58,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:58,575 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:58,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1439654222, now seen corresponding path program 1 times [2024-10-14 21:17:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:58,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710402912] [2024-10-14 21:17:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 21:17:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710402912] [2024-10-14 21:17:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710402912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 21:17:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488843703] [2024-10-14 21:17:58,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:58,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 21:17:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 21:17:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 21:17:58,693 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:58,856 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-10-14 21:17:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:17:58,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-14 21:17:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:58,858 INFO L225 Difference]: With dead ends: 102 [2024-10-14 21:17:58,858 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 21:17:58,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:58,858 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 48 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:58,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 227 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 21:17:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 21:17:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 89 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:17:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-10-14 21:17:58,863 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 29 [2024-10-14 21:17:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:58,864 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-10-14 21:17:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:17:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-10-14 21:17:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:17:58,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:58,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:58,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 21:17:58,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -318232785, now seen corresponding path program 1 times [2024-10-14 21:17:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153532729] [2024-10-14 21:17:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153532729] [2024-10-14 21:17:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153532729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63420532] [2024-10-14 21:17:58,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:58,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:58,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:58,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:17:58,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:17:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:59,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:17:59,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:59,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:17:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63420532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:17:59,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:17:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-14 21:17:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943732932] [2024-10-14 21:17:59,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:17:59,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 21:17:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 21:17:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:59,237 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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-14 21:17:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:59,466 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-10-14 21:17:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 21:17:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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 29 [2024-10-14 21:17:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:59,468 INFO L225 Difference]: With dead ends: 102 [2024-10-14 21:17:59,468 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 21:17:59,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-10-14 21:17:59,469 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 109 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:59,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 330 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 21:17:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-10-14 21:17:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 87 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:17:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-10-14 21:17:59,475 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 29 [2024-10-14 21:17:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:59,475 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-10-14 21:17:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 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-14 21:17:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-10-14 21:17:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 21:17:59,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:59,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:59,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:59,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:59,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:17:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -879026799, now seen corresponding path program 1 times [2024-10-14 21:17:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330403522] [2024-10-14 21:17:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:17:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330403522] [2024-10-14 21:17:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330403522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265155837] [2024-10-14 21:17:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:59,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:17:59,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 21:17:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:59,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:17:59,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:17:59,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265155837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:59,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-10-14 21:17:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078539807] [2024-10-14 21:17:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:59,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:59,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:59,944 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:18:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:00,028 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-10-14 21:18:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:18:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-14 21:18:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:00,029 INFO L225 Difference]: With dead ends: 96 [2024-10-14 21:18:00,029 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 21:18:00,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:18:00,031 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:00,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 181 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 21:18:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 21:18:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 85 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:18:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2024-10-14 21:18:00,039 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 31 [2024-10-14 21:18:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:00,040 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2024-10-14 21:18:00,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:18:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2024-10-14 21:18:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 21:18:00,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:00,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:00,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:00,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 21:18:00,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1480026940, now seen corresponding path program 1 times [2024-10-14 21:18:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599500897] [2024-10-14 21:18:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:00,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:00,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599500897] [2024-10-14 21:18:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599500897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870965654] [2024-10-14 21:18:00,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:00,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:00,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:00,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:00,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:18:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:00,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:18:00,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:00,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870965654] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:00,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-14 21:18:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320029329] [2024-10-14 21:18:00,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:00,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 21:18:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:00,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 21:18:00,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:18:00,691 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:00,986 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-10-14 21:18:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 21:18:00,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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 32 [2024-10-14 21:18:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:00,988 INFO L225 Difference]: With dead ends: 98 [2024-10-14 21:18:00,988 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 21:18:00,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2024-10-14 21:18:00,989 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 90 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:00,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 325 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 21:18:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-14 21:18:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 83 states have internal predecessors, (94), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:18:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-10-14 21:18:00,994 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 32 [2024-10-14 21:18:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:00,994 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-10-14 21:18:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-10-14 21:18:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 21:18:00,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:00,995 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:01,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:18:01,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 21:18:01,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:01,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1221832158, now seen corresponding path program 1 times [2024-10-14 21:18:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783709408] [2024-10-14 21:18:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 21:18:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 21:18:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783709408] [2024-10-14 21:18:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783709408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:01,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:01,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:18:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615601417] [2024-10-14 21:18:01,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:01,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:18:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:18:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:18:01,298 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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-14 21:18:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:01,400 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2024-10-14 21:18:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:18:01,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 36 [2024-10-14 21:18:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:01,401 INFO L225 Difference]: With dead ends: 114 [2024-10-14 21:18:01,401 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 21:18:01,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:18:01,402 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:01,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 187 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 21:18:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 21:18:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 98 states have internal predecessors, (110), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 21:18:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2024-10-14 21:18:01,408 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 36 [2024-10-14 21:18:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:01,408 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2024-10-14 21:18:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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-14 21:18:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2024-10-14 21:18:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 21:18:01,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:01,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:01,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 21:18:01,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 266973242, now seen corresponding path program 1 times [2024-10-14 21:18:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572569627] [2024-10-14 21:18:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 21:18:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:18:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:01,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572569627] [2024-10-14 21:18:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572569627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:01,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:18:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050108891] [2024-10-14 21:18:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:01,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:18:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:18:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:18:01,541 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:01,625 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2024-10-14 21:18:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:18:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 38 [2024-10-14 21:18:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:01,627 INFO L225 Difference]: With dead ends: 112 [2024-10-14 21:18:01,627 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 21:18:01,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:18:01,628 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:01,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 109 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 21:18:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2024-10-14 21:18:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 90 states have internal predecessors, (101), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:18:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2024-10-14 21:18:01,634 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 38 [2024-10-14 21:18:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-10-14 21:18:01,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2024-10-14 21:18:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 21:18:01,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:01,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:01,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 21:18:01,636 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:01,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -245914231, now seen corresponding path program 1 times [2024-10-14 21:18:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004364185] [2024-10-14 21:18:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 21:18:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 21:18:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004364185] [2024-10-14 21:18:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004364185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:01,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:01,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 21:18:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642243751] [2024-10-14 21:18:01,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:01,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:18:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:18:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:18:01,755 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-14 21:18:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:01,862 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2024-10-14 21:18:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:18:01,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 39 [2024-10-14 21:18:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:01,863 INFO L225 Difference]: With dead ends: 130 [2024-10-14 21:18:01,864 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 21:18:01,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:18:01,864 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:01,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 263 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 21:18:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-14 21:18:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 83 states have internal predecessors, (91), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:18:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-10-14 21:18:01,870 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 39 [2024-10-14 21:18:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:01,871 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-10-14 21:18:01,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-14 21:18:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-10-14 21:18:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:18:01,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:01,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:01,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 21:18:01,872 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:01,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:01,873 INFO L85 PathProgramCache]: Analyzing trace with hash -879479379, now seen corresponding path program 1 times [2024-10-14 21:18:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556947108] [2024-10-14 21:18:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 21:18:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:18:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556947108] [2024-10-14 21:18:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556947108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 21:18:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405010704] [2024-10-14 21:18:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:02,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:18:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:02,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:18:02,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:18:02,064 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:02,303 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2024-10-14 21:18:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:18:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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 41 [2024-10-14 21:18:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:02,305 INFO L225 Difference]: With dead ends: 113 [2024-10-14 21:18:02,305 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 21:18:02,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:18:02,306 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 71 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:02,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 239 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 21:18:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 21:18:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 82 states have internal predecessors, (89), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:18:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-10-14 21:18:02,318 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 41 [2024-10-14 21:18:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:02,318 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-10-14 21:18:02,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-10-14 21:18:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:18:02,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:02,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:02,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 21:18:02,319 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:02,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2142729214, now seen corresponding path program 1 times [2024-10-14 21:18:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993110268] [2024-10-14 21:18:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:02,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:18:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:02,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993110268] [2024-10-14 21:18:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993110268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232323139] [2024-10-14 21:18:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:02,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:02,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:02,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:18:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:02,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 21:18:02,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:02,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232323139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:03,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2024-10-14 21:18:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51307093] [2024-10-14 21:18:03,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 21:18:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 21:18:03,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2024-10-14 21:18:03,304 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 30 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 30 states have internal predecessors, (86), 7 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-14 21:18:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:03,893 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2024-10-14 21:18:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:18:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 30 states have internal predecessors, (86), 7 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 41 [2024-10-14 21:18:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:03,895 INFO L225 Difference]: With dead ends: 136 [2024-10-14 21:18:03,895 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 21:18:03,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 21:18:03,896 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 253 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:03,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 275 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:18:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 21:18:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 87. [2024-10-14 21:18:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 77 states have internal predecessors, (82), 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-14 21:18:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-10-14 21:18:03,902 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 41 [2024-10-14 21:18:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:03,903 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-10-14 21:18:03,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 30 states have internal predecessors, (86), 7 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-14 21:18:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-10-14 21:18:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:18:03,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:03,904 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 21:18:03,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:18:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:04,105 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1281989565, now seen corresponding path program 1 times [2024-10-14 21:18:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:04,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139896878] [2024-10-14 21:18:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139896878] [2024-10-14 21:18:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139896878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454792308] [2024-10-14 21:18:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:04,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:04,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:18:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:18:04,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:04,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454792308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:04,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:04,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-14 21:18:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646332647] [2024-10-14 21:18:04,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:04,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 21:18:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:04,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 21:18:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:18:04,354 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:04,470 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2024-10-14 21:18:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:18:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 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 41 [2024-10-14 21:18:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:04,474 INFO L225 Difference]: With dead ends: 148 [2024-10-14 21:18:04,475 INFO L226 Difference]: Without dead ends: 147 [2024-10-14 21:18:04,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:18:04,476 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:04,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 354 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-14 21:18:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2024-10-14 21:18:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 119 states have internal predecessors, (133), 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-14 21:18:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2024-10-14 21:18:04,485 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 41 [2024-10-14 21:18:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:04,485 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2024-10-14 21:18:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2024-10-14 21:18:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 21:18:04,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:04,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:04,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 21:18:04,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 21:18:04,687 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:04,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:04,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1873436892, now seen corresponding path program 1 times [2024-10-14 21:18:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907965081] [2024-10-14 21:18:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:04,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 21:18:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907965081] [2024-10-14 21:18:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907965081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238898560] [2024-10-14 21:18:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:04,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:04,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:04,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:04,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:18:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:05,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 21:18:05,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:05,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238898560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:05,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-10-14 21:18:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975297117] [2024-10-14 21:18:05,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:05,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 21:18:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 21:18:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:18:05,495 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:18:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:05,955 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2024-10-14 21:18:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:18:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 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 43 [2024-10-14 21:18:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:05,957 INFO L225 Difference]: With dead ends: 131 [2024-10-14 21:18:05,957 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 21:18:05,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 21:18:05,958 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 103 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:05,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 469 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 21:18:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-10-14 21:18:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.1415094339622642) internal successors, (121), 111 states have internal predecessors, (121), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:18:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2024-10-14 21:18:05,965 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 43 [2024-10-14 21:18:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:05,965 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2024-10-14 21:18:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:18:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2024-10-14 21:18:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:18:05,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:05,966 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:05,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:18:06,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:06,167 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:06,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2047497459, now seen corresponding path program 1 times [2024-10-14 21:18:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:06,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267591742] [2024-10-14 21:18:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 21:18:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 21:18:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267591742] [2024-10-14 21:18:06,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267591742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:06,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:06,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:18:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085178353] [2024-10-14 21:18:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:06,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:18:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:06,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:18:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:18:06,293 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:06,396 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2024-10-14 21:18:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:18:06,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-10-14 21:18:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:06,398 INFO L225 Difference]: With dead ends: 134 [2024-10-14 21:18:06,398 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 21:18:06,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:18:06,399 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:06,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 21:18:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 21:18:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-10-14 21:18:06,407 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 45 [2024-10-14 21:18:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:06,407 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-10-14 21:18:06,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2024-10-14 21:18:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:18:06,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:06,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:06,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 21:18:06,408 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:06,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash 29699784, now seen corresponding path program 1 times [2024-10-14 21:18:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442218640] [2024-10-14 21:18:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:18:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442218640] [2024-10-14 21:18:06,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442218640] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363265682] [2024-10-14 21:18:06,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:06,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:06,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:18:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:06,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:18:06,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:06,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363265682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:07,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2024-10-14 21:18:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005821685] [2024-10-14 21:18:07,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 21:18:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 21:18:07,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:18:07,144 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 25 states, 21 states have (on average 4.571428571428571) internal successors, (96), 25 states have internal predecessors, (96), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 21:18:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:07,678 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2024-10-14 21:18:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 21:18:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.571428571428571) internal successors, (96), 25 states have internal predecessors, (96), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 45 [2024-10-14 21:18:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:07,680 INFO L225 Difference]: With dead ends: 140 [2024-10-14 21:18:07,680 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 21:18:07,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 21:18:07,681 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 168 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:07,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 333 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:18:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 21:18:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 114. [2024-10-14 21:18:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 106 states have internal predecessors, (114), 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-14 21:18:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2024-10-14 21:18:07,689 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 45 [2024-10-14 21:18:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:07,689 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2024-10-14 21:18:07,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.571428571428571) internal successors, (96), 25 states have internal predecessors, (96), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 21:18:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2024-10-14 21:18:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 21:18:07,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:07,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-14 21:18:07,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:18:07,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 21:18:07,891 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:07,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 24945444, now seen corresponding path program 1 times [2024-10-14 21:18:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833398654] [2024-10-14 21:18:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:18:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:18:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833398654] [2024-10-14 21:18:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833398654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235667858] [2024-10-14 21:18:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:08,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:08,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:18:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:18:08,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:08,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235667858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:08,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:18:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-10-14 21:18:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022838225] [2024-10-14 21:18:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:18:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:18:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:18:08,341 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:08,425 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2024-10-14 21:18:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:18:08,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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 52 [2024-10-14 21:18:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:08,427 INFO L225 Difference]: With dead ends: 114 [2024-10-14 21:18:08,427 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 21:18:08,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:18:08,428 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:08,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 100 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 21:18:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-14 21:18:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.118811881188119) internal successors, (113), 105 states have internal predecessors, (113), 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-14 21:18:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2024-10-14 21:18:08,440 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 52 [2024-10-14 21:18:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:08,440 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2024-10-14 21:18:08,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:18:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2024-10-14 21:18:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 21:18:08,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:08,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-14 21:18:08,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:08,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 21:18:08,644 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:08,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:08,644 INFO L85 PathProgramCache]: Analyzing trace with hash 120480387, now seen corresponding path program 1 times [2024-10-14 21:18:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:08,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011848106] [2024-10-14 21:18:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:18:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:18:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011848106] [2024-10-14 21:18:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011848106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344933187] [2024-10-14 21:18:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:08,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:08,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:08,944 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:08,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 21:18:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:09,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 21:18:09,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 21:18:09,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 21:18:09,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344933187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:09,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:09,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 20 [2024-10-14 21:18:09,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272635702] [2024-10-14 21:18:09,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:09,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 21:18:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 21:18:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-14 21:18:09,364 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 21 states, 20 states have (on average 4.4) internal successors, (88), 21 states have internal predecessors, (88), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 21:18:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:09,887 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2024-10-14 21:18:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 21:18:09,888 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.4) internal successors, (88), 21 states have internal predecessors, (88), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 55 [2024-10-14 21:18:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:09,890 INFO L225 Difference]: With dead ends: 136 [2024-10-14 21:18:09,890 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 21:18:09,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 21:18:09,891 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 146 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:09,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 408 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 21:18:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2024-10-14 21:18:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 97 states have (on average 1.1030927835051547) internal successors, (107), 99 states have internal predecessors, (107), 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-14 21:18:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-10-14 21:18:09,899 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 55 [2024-10-14 21:18:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:09,899 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-10-14 21:18:09,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.4) internal successors, (88), 21 states have internal predecessors, (88), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 21:18:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-10-14 21:18:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 21:18:09,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:09,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-14 21:18:09,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 21:18:10,101 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash -560075191, now seen corresponding path program 1 times [2024-10-14 21:18:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117497309] [2024-10-14 21:18:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:10,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:10,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:18:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:18:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117497309] [2024-10-14 21:18:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117497309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888241052] [2024-10-14 21:18:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:10,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:10,271 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:10,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 21:18:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:10,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 21:18:10,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:10,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888241052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:10,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:10,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-10-14 21:18:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542877520] [2024-10-14 21:18:10,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:10,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 21:18:10,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:10,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 21:18:10,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:18:10,614 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 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-14 21:18:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:10,856 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-10-14 21:18:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 21:18:10,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 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 56 [2024-10-14 21:18:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:10,857 INFO L225 Difference]: With dead ends: 109 [2024-10-14 21:18:10,858 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 21:18:10,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:18:10,859 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:10,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 206 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 21:18:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-14 21:18:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 83 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:18:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-10-14 21:18:10,865 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 56 [2024-10-14 21:18:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-10-14 21:18:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 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-14 21:18:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-10-14 21:18:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 21:18:10,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:10,867 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:10,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 21:18:11,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-14 21:18:11,068 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:11,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -695868428, now seen corresponding path program 2 times [2024-10-14 21:18:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:11,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039512036] [2024-10-14 21:18:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:11,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:18:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 21:18:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039512036] [2024-10-14 21:18:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039512036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777775607] [2024-10-14 21:18:11,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:18:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:11,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:11,378 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:11,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 21:18:11,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:18:11,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:18:11,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 21:18:11,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 21:18:11,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 21:18:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777775607] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:12,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 30 [2024-10-14 21:18:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037072266] [2024-10-14 21:18:12,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 21:18:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 21:18:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2024-10-14 21:18:12,098 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 31 states, 27 states have (on average 4.555555555555555) internal successors, (123), 31 states have internal predecessors, (123), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-14 21:18:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:12,423 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-10-14 21:18:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 21:18:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.555555555555555) internal successors, (123), 31 states have internal predecessors, (123), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 73 [2024-10-14 21:18:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:12,424 INFO L225 Difference]: With dead ends: 89 [2024-10-14 21:18:12,425 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 21:18:12,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1264, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 21:18:12,426 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:12,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 21:18:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 21:18:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:18:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-10-14 21:18:12,432 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 73 [2024-10-14 21:18:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:12,432 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-10-14 21:18:12,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.555555555555555) internal successors, (123), 31 states have internal predecessors, (123), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-14 21:18:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-10-14 21:18:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 21:18:12,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:12,433 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:12,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:12,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:12,637 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:12,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 497139525, now seen corresponding path program 2 times [2024-10-14 21:18:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756682403] [2024-10-14 21:18:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756682403] [2024-10-14 21:18:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756682403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139367204] [2024-10-14 21:18:12,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:18:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:12,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:12,808 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 21:18:12,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:18:12,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:18:12,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 21:18:12,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:13,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139367204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:13,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-10-14 21:18:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047742998] [2024-10-14 21:18:13,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 21:18:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 21:18:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:18:13,200 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 24 states, 23 states have (on average 7.043478260869565) internal successors, (162), 24 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:13,332 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2024-10-14 21:18:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 21:18:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.043478260869565) internal successors, (162), 24 states have internal predecessors, (162), 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 83 [2024-10-14 21:18:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:13,333 INFO L225 Difference]: With dead ends: 165 [2024-10-14 21:18:13,333 INFO L226 Difference]: Without dead ends: 164 [2024-10-14 21:18:13,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:18:13,334 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:13,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-14 21:18:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-14 21:18:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 1.00625) internal successors, (161), 160 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:18:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2024-10-14 21:18:13,345 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 83 [2024-10-14 21:18:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2024-10-14 21:18:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.043478260869565) internal successors, (162), 24 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2024-10-14 21:18:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 21:18:13,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:13,347 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:13,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 21:18:13,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:13,552 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1881075145, now seen corresponding path program 3 times [2024-10-14 21:18:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:18:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017824688] [2024-10-14 21:18:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:18:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:18:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:14,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:18:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 770 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:14,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:18:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017824688] [2024-10-14 21:18:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017824688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396322491] [2024-10-14 21:18:14,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:18:14,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:14,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:18:14,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 21:18:14,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 21:18:14,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:18:14,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 21:18:14,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-10-14 21:18:14,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-10-14 21:18:14,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396322491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:14,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:18:14,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10] total 35 [2024-10-14 21:18:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878744465] [2024-10-14 21:18:14,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:14,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-14 21:18:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:18:14,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-14 21:18:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 21:18:14,925 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand has 36 states, 35 states have (on average 5.942857142857143) internal successors, (208), 34 states have internal predecessors, (208), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 21:18:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:15,609 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2024-10-14 21:18:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 21:18:15,609 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.942857142857143) internal successors, (208), 34 states have internal predecessors, (208), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-10-14 21:18:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:15,610 INFO L225 Difference]: With dead ends: 185 [2024-10-14 21:18:15,610 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:18:15,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=783, Invalid=3123, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 21:18:15,612 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 534 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 109 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:18:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:18:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:18:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:18:15,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2024-10-14 21:18:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:15,613 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:18:15,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.942857142857143) internal successors, (208), 34 states have internal predecessors, (208), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 21:18:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:18:15,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:18:15,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-14 21:18:15,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-14 21:18:15,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-14 21:18:15,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-14 21:18:15,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-14 21:18:15,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-14 21:18:15,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-14 21:18:15,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-14 21:18:15,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-14 21:18:15,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-14 21:18:15,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-14 21:18:15,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:18:15,823 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:15,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:18:16,413 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:18:16,422 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-14 21:18:16,426 INFO L158 Benchmark]: Toolchain (without parser) took 23131.64ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 109.6MB in the beginning and 90.6MB in the end (delta: 19.0MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-10-14 21:18:16,427 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 163.6MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:18:16,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.61ms. Allocated memory is still 163.6MB. Free memory was 109.6MB in the beginning and 96.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 21:18:16,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.90ms. Allocated memory is still 163.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:18:16,427 INFO L158 Benchmark]: Boogie Preprocessor took 49.16ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:18:16,427 INFO L158 Benchmark]: RCFGBuilder took 590.42ms. Allocated memory is still 163.6MB. Free memory was 92.4MB in the beginning and 70.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 21:18:16,427 INFO L158 Benchmark]: TraceAbstraction took 22147.23ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 70.1MB in the beginning and 90.6MB in the end (delta: -20.4MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-10-14 21:18:16,428 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.99ms. Allocated memory is still 163.6MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.61ms. Allocated memory is still 163.6MB. Free memory was 109.6MB in the beginning and 96.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.90ms. Allocated memory is still 163.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.16ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.42ms. Allocated memory is still 163.6MB. Free memory was 92.4MB in the beginning and 70.7MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22147.23ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 70.1MB in the beginning and 90.6MB in the end (delta: -20.4MB). Peak memory consumption was 70.1MB. 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: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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, 70 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 31, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2284 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2269 mSDsluCounter, 6462 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5181 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5668 IncrementalHoareTripleChecker+Invalid, 5738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1281 mSDtfsCounter, 5668 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2011 GetRequests, 1521 SyntacticMatches, 19 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=30, InterpolantAutomatonStates: 316, 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, 31 MinimizatonAttempts, 141 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2063 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 12531 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2441 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 58 InterpolantComputations, 20 PerfectInterpolantSequences, 1927/3606 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-14 21:18:16,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:18:18,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:18:18,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-14 21:18:18,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:18:18,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:18:18,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:18:18,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:18:18,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:18:18,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:18:18,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:18:18,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:18:18,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:18:18,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:18:18,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:18:18,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:18:18,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:18:18,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:18:18,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:18:18,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:18:18,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:18:18,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:18:18,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:18:18,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:18:18,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 21:18:18,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 21:18:18,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:18:18,837 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:18:18,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 21:18:18,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:18:18,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:18:18,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:18:18,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:18:18,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:18:18,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:18:18,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:18:18,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:18:18,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:18:18,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:18:18,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:18:18,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:18:18,842 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 21:18:18,844 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 21:18:18,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:18:18,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:18:18,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:18:18,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:18:18,845 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 21:18:18,846 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2024-10-14 21:18:19,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:18:19,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:18:19,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:18:19,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:18:19,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:18:19,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2024-10-14 21:18:20,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:18:20,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:18:20,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2024-10-14 21:18:21,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b0cdf3a/44e4b9dbd9844ee1a314d41d1bd20fad/FLAG72a169ec0 [2024-10-14 21:18:21,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b0cdf3a/44e4b9dbd9844ee1a314d41d1bd20fad [2024-10-14 21:18:21,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:18:21,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:18:21,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:18:21,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:18:21,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:18:21,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da096ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21, skipping insertion in model container [2024-10-14 21:18:21,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:18:21,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:18:21,578 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:18:21,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:18:21,633 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:18:21,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21 WrapperNode [2024-10-14 21:18:21,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:18:21,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:18:21,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:18:21,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:18:21,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,680 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-10-14 21:18:21,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:18:21,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:18:21,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:18:21,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:18:21,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,726 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 7, 6]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6]. The 1 writes are split as follows [0, 1, 0]. [2024-10-14 21:18:21,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:18:21,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:18:21,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:18:21,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:18:21,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (1/1) ... [2024-10-14 21:18:21,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:18:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:18:21,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:18:21,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:18:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:18:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 21:18:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 21:18:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 21:18:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:18:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:18:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 21:18:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 21:18:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 21:18:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 21:18:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:18:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:18:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:18:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:18:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 21:18:21,966 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:18:21,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:18:22,336 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-10-14 21:18:22,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:18:22,409 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:18:22,410 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 21:18:22,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:18:22 BoogieIcfgContainer [2024-10-14 21:18:22,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:18:22,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:18:22,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:18:22,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:18:22,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:18:21" (1/3) ... [2024-10-14 21:18:22,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c254929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:18:22, skipping insertion in model container [2024-10-14 21:18:22,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:18:21" (2/3) ... [2024-10-14 21:18:22,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c254929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:18:22, skipping insertion in model container [2024-10-14 21:18:22,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:18:22" (3/3) ... [2024-10-14 21:18:22,421 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-10-14 21:18:22,435 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:18:22,435 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-14 21:18:22,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:18:22,512 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;@263029d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:18:22,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-14 21:18:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 40 states have (on average 1.75) internal successors, (70), 63 states have internal predecessors, (70), 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-14 21:18:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:18:22,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:22,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:22,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:22,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash -607891599, now seen corresponding path program 1 times [2024-10-14 21:18:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44676106] [2024-10-14 21:18:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:22,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:22,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 21:18:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:22,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 21:18:22,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 21:18:22,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:22,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44676106] [2024-10-14 21:18:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44676106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:22,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:22,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:18:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067823677] [2024-10-14 21:18:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 21:18:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 21:18:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:18:22,725 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.75) internal successors, (70), 63 states have internal predecessors, (70), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:18:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:22,762 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2024-10-14 21:18:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 21:18:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-14 21:18:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:22,770 INFO L225 Difference]: With dead ends: 137 [2024-10-14 21:18:22,770 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 21:18:22,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:18:22,776 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:22,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:18:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 21:18:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 21:18:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 59 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-10-14 21:18:22,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 14 [2024-10-14 21:18:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-10-14 21:18:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:18:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-10-14 21:18:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:18:22,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:22,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:22,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 21:18:23,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:23,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:23,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash 95020021, now seen corresponding path program 1 times [2024-10-14 21:18:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724587850] [2024-10-14 21:18:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:23,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:23,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 21:18:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:23,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:18:23,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:18:23,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:23,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724587850] [2024-10-14 21:18:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724587850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:18:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326374125] [2024-10-14 21:18:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:18:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:18:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:18:23,198 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:23,416 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-10-14 21:18:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:18:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-14 21:18:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:23,419 INFO L225 Difference]: With dead ends: 87 [2024-10-14 21:18:23,419 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 21:18:23,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:18:23,420 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:23,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 235 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 21:18:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-14 21:18:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.52) internal successors, (76), 70 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-10-14 21:18:23,438 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 14 [2024-10-14 21:18:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:23,440 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-10-14 21:18:23,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-10-14 21:18:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 21:18:23,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:23,443 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:23,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:23,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:23,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash -235007229, now seen corresponding path program 1 times [2024-10-14 21:18:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790419258] [2024-10-14 21:18:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:23,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:23,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:23,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:23,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 21:18:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:23,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:18:23,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:23,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:23,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:23,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790419258] [2024-10-14 21:18:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790419258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:18:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384229293] [2024-10-14 21:18:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:23,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:18:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:23,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:18:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:18:23,804 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:23,850 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-10-14 21:18:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:18:23,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 21:18:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:23,853 INFO L225 Difference]: With dead ends: 147 [2024-10-14 21:18:23,853 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 21:18:23,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:18:23,854 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:23,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:18:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 21:18:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-14 21:18:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.490566037735849) internal successors, (79), 73 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-10-14 21:18:23,863 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 21 [2024-10-14 21:18:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-10-14 21:18:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-10-14 21:18:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 21:18:23,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:23,864 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:23,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:24,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:24,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1386963343, now seen corresponding path program 1 times [2024-10-14 21:18:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110257746] [2024-10-14 21:18:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:24,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:24,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 21:18:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:24,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:18:24,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:18:24,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:24,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110257746] [2024-10-14 21:18:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110257746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:24,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:24,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:18:24,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288648570] [2024-10-14 21:18:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:24,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:18:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:18:24,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:18:24,212 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:18:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:24,389 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-10-14 21:18:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:18:24,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-14 21:18:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:24,393 INFO L225 Difference]: With dead ends: 118 [2024-10-14 21:18:24,395 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 21:18:24,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:18:24,396 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 8 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:24,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 241 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 21:18:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 21:18:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-10-14 21:18:24,412 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 26 [2024-10-14 21:18:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:24,412 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-10-14 21:18:24,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:18:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-10-14 21:18:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 21:18:24,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:24,414 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] [2024-10-14 21:18:24,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:24,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 906930413, now seen corresponding path program 1 times [2024-10-14 21:18:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314045073] [2024-10-14 21:18:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:24,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:24,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:24,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 21:18:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:24,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:18:24,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:24,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:24,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:24,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314045073] [2024-10-14 21:18:24,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314045073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:24,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:18:24,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231182103] [2024-10-14 21:18:24,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:24,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:18:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:24,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:18:24,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:18:24,720 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:24,801 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-14 21:18:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:18:24,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 27 [2024-10-14 21:18:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:24,803 INFO L225 Difference]: With dead ends: 84 [2024-10-14 21:18:24,803 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 21:18:24,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:18:24,804 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:24,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 21:18:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 21:18:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-14 21:18:24,811 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 27 [2024-10-14 21:18:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:24,811 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-14 21:18:24,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-14 21:18:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 21:18:24,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:24,812 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] [2024-10-14 21:18:24,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:25,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:25,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:25,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1949928225, now seen corresponding path program 1 times [2024-10-14 21:18:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327855652] [2024-10-14 21:18:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:25,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:25,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:25,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 21:18:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:25,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:18:25,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:18:25,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:25,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327855652] [2024-10-14 21:18:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327855652] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:25,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:18:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2024-10-14 21:18:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897569073] [2024-10-14 21:18:25,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 21:18:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 21:18:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:18:25,380 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:18:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:25,809 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-10-14 21:18:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:18:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-14 21:18:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:25,811 INFO L225 Difference]: With dead ends: 108 [2024-10-14 21:18:25,811 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 21:18:25,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:18:25,812 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 114 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:25,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 314 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:18:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 21:18:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2024-10-14 21:18:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 90 states have internal predecessors, (102), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-10-14 21:18:25,825 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 28 [2024-10-14 21:18:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:25,825 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-10-14 21:18:25,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:18:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-10-14 21:18:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:18:25,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:25,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:25,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 21:18:26,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:26,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash -318232785, now seen corresponding path program 1 times [2024-10-14 21:18:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365040938] [2024-10-14 21:18:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:26,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:26,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:26,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:26,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 21:18:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:26,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 21:18:26,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:26,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:26,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:26,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365040938] [2024-10-14 21:18:26,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365040938] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:26,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:18:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-10-14 21:18:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976881776] [2024-10-14 21:18:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:18:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:18:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:18:26,841 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:27,095 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-14 21:18:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:18:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 29 [2024-10-14 21:18:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:27,096 INFO L225 Difference]: With dead ends: 99 [2024-10-14 21:18:27,096 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 21:18:27,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-14 21:18:27,097 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:27,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 221 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 21:18:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-10-14 21:18:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.380281690140845) internal successors, (98), 88 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-14 21:18:27,114 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 29 [2024-10-14 21:18:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:27,114 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-14 21:18:27,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-14 21:18:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 21:18:27,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:27,115 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:27,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 21:18:27,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:27,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:27,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1480026940, now seen corresponding path program 1 times [2024-10-14 21:18:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102706540] [2024-10-14 21:18:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:27,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:27,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:27,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:27,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 21:18:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:27,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 21:18:27,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:27,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:28,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:28,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102706540] [2024-10-14 21:18:28,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102706540] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:28,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:18:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-10-14 21:18:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392575132] [2024-10-14 21:18:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:28,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 21:18:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:28,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 21:18:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-14 21:18:28,181 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:28,468 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-10-14 21:18:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:18:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 32 [2024-10-14 21:18:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:28,471 INFO L225 Difference]: With dead ends: 96 [2024-10-14 21:18:28,471 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 21:18:28,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2024-10-14 21:18:28,472 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:28,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 21:18:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-14 21:18:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.323943661971831) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-14 21:18:28,478 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 32 [2024-10-14 21:18:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:28,479 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-14 21:18:28,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-14 21:18:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 21:18:28,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:28,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:28,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:28,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:28,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:28,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:28,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1177805689, now seen corresponding path program 1 times [2024-10-14 21:18:28,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:28,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949219046] [2024-10-14 21:18:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:28,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:28,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:28,683 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:28,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 21:18:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:28,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:18:28,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:28,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:18:28,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949219046] [2024-10-14 21:18:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949219046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:18:28,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:18:28,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:18:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535787759] [2024-10-14 21:18:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:18:28,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:18:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:28,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:18:28,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:18:28,966 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:18:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:29,077 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-14 21:18:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:18:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-14 21:18:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:29,079 INFO L225 Difference]: With dead ends: 93 [2024-10-14 21:18:29,079 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 21:18:29,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:18:29,080 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:29,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 179 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:18:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 21:18:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 21:18:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.267605633802817) internal successors, (90), 82 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-14 21:18:29,089 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 40 [2024-10-14 21:18:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:29,089 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-14 21:18:29,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 21:18:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-14 21:18:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:18:29,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:29,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:29,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 21:18:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:29,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2142729214, now seen corresponding path program 1 times [2024-10-14 21:18:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605608849] [2024-10-14 21:18:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:29,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:29,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:29,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 21:18:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:29,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 21:18:29,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:18:29,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:30,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605608849] [2024-10-14 21:18:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605608849] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [885708249] [2024-10-14 21:18:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 21:18:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 21:18:30,022 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 21:18:30,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-14 21:18:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:30,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 21:18:30,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:30,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-14 21:18:34,234 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-10-14 21:18:43,532 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 21:18:43,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 21:18:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 4 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:43,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [885708249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:18:44,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:18:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 24 [2024-10-14 21:18:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634702146] [2024-10-14 21:18:44,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:44,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 21:18:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 21:18:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=555, Unknown=3, NotChecked=48, Total=702 [2024-10-14 21:18:44,020 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 25 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:48,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:18:52,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:18:56,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 21:18:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:57,038 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-10-14 21:18:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 21:18:57,039 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 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) Word has length 41 [2024-10-14 21:18:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:57,040 INFO L225 Difference]: With dead ends: 117 [2024-10-14 21:18:57,040 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 21:18:57,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=141, Invalid=790, Unknown=3, NotChecked=58, Total=992 [2024-10-14 21:18:57,041 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:57,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 485 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 480 Invalid, 3 Unknown, 133 Unchecked, 12.7s Time] [2024-10-14 21:18:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 21:18:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 21:18:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:18:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-10-14 21:18:57,048 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 41 [2024-10-14 21:18:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:57,049 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-10-14 21:18:57,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 21:18:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-10-14 21:18:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 21:18:57,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:57,050 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 21:18:57,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 21:18:57,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-10-14 21:18:57,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 21:18:57,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:57,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1281989565, now seen corresponding path program 1 times [2024-10-14 21:18:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:57,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902760766] [2024-10-14 21:18:57,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:57,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:57,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:57,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:57,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 21:18:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:57,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:18:57,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:57,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:57,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902760766] [2024-10-14 21:18:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902760766] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:57,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:18:57,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 21:18:57,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125542298] [2024-10-14 21:18:57,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:57,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:18:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:57,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:18:57,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:18:57,713 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:57,925 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2024-10-14 21:18:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:18:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 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 41 [2024-10-14 21:18:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:57,927 INFO L225 Difference]: With dead ends: 148 [2024-10-14 21:18:57,927 INFO L226 Difference]: Without dead ends: 147 [2024-10-14 21:18:57,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:18:57,928 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:57,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 278 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:18:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-14 21:18:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2024-10-14 21:18:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 129 states have internal predecessors, (149), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:18:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2024-10-14 21:18:57,935 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 41 [2024-10-14 21:18:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:57,935 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2024-10-14 21:18:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 21:18:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2024-10-14 21:18:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:18:57,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:57,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:18:57,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 21:18:58,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:58,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2106146279, now seen corresponding path program 1 times [2024-10-14 21:18:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218743939] [2024-10-14 21:18:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:58,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:58,142 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:58,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 21:18:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:58,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 21:18:58,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:18:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:18:58,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:18:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:18:58,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:18:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218743939] [2024-10-14 21:18:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218743939] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:18:58,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:18:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2024-10-14 21:18:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591942349] [2024-10-14 21:18:58,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:18:58,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 21:18:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:18:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 21:18:58,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:18:58,646 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:18:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:18:59,402 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2024-10-14 21:18:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 21:18:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-14 21:18:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:18:59,406 INFO L225 Difference]: With dead ends: 156 [2024-10-14 21:18:59,406 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 21:18:59,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:18:59,407 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:18:59,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 431 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:18:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 21:18:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2024-10-14 21:18:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 132 states have internal predecessors, (150), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:18:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2024-10-14 21:18:59,417 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 45 [2024-10-14 21:18:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:18:59,418 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2024-10-14 21:18:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:18:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2024-10-14 21:18:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 21:18:59,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:18:59,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-14 21:18:59,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 21:18:59,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:59,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:18:59,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:18:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 306113645, now seen corresponding path program 1 times [2024-10-14 21:18:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:18:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130038103] [2024-10-14 21:18:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:18:59,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:18:59,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:18:59,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:18:59,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 21:18:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:18:59,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 21:18:59,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:19:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:19:00,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:19:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:19:00,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:19:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130038103] [2024-10-14 21:19:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130038103] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:19:00,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:19:00,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2024-10-14 21:19:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832775326] [2024-10-14 21:19:00,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:19:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 21:19:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:19:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 21:19:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-10-14 21:19:00,590 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand has 20 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:19:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:19:01,744 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2024-10-14 21:19:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:19:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2024-10-14 21:19:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:19:01,746 INFO L225 Difference]: With dead ends: 169 [2024-10-14 21:19:01,746 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 21:19:01,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2024-10-14 21:19:01,747 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 117 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 21:19:01,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 527 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 21:19:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 21:19:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-10-14 21:19:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 133 states have internal predecessors, (152), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:19:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2024-10-14 21:19:01,754 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 54 [2024-10-14 21:19:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:19:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2024-10-14 21:19:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:19:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2024-10-14 21:19:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 21:19:01,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:19:01,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-10-14 21:19:01,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 21:19:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:19:01,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 21:19:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:19:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1142769448, now seen corresponding path program 2 times [2024-10-14 21:19:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 21:19:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549922007] [2024-10-14 21:19:01,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:19:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 21:19:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 21:19:01,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 21:19:01,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 21:19:02,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:19:02,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:19:02,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 21:19:02,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:19:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:19:02,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:19:02,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 21:19:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549922007] [2024-10-14 21:19:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549922007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:19:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [95073584] [2024-10-14 21:19:02,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:19:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 21:19:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 21:19:02,718 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 21:19:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-10-14 21:19:02,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:19:02,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:19:02,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 21:19:02,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:19:02,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-14 21:19:06,877 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-10-14 21:19:07,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 21:19:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 26 refuted. 1 times theorem prover too weak. 4 trivial. 6 not checked. [2024-10-14 21:19:08,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:19:08,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [95073584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:19:08,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:19:08,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2024-10-14 21:19:08,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334108203] [2024-10-14 21:19:08,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:19:08,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 21:19:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 21:19:08,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 21:19:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=731, Unknown=1, NotChecked=54, Total=870 [2024-10-14 21:19:08,336 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand has 28 states, 25 states have (on average 3.4) internal successors, (85), 27 states have internal predecessors, (85), 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)