./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 376367d14f0ef5deff3321a7267050cf9f2383eb99d0a19dad6a556c0772ff28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:39:21,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:39:21,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:39:21,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:39:21,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:39:21,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:39:21,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:39:21,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:39:21,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:39:21,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:39:21,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:39:21,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:39:21,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:39:21,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:39:21,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:39:21,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:39:21,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:39:21,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:39:21,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:39:21,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:39:21,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:39:21,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:39:21,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:39:21,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:39:21,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:39:21,389 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:39:21,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:39:21,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:39:21,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:39:21,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:39:21,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:39:21,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:39:21,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:39:21,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:39:21,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:39:21,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:39:21,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:39:21,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:39:21,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:39:21,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:39:21,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:39:21,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:39:21,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:39:21,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:39:21,396 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 376367d14f0ef5deff3321a7267050cf9f2383eb99d0a19dad6a556c0772ff28 [2024-10-11 20:39:21,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:39:21,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:39:21,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:39:21,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:39:21,714 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:39:21,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2024-10-11 20:39:23,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:39:23,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:39:23,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2024-10-11 20:39:23,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/08518d400/09efbef90e464349b3d7d0e98e2a56ab/FLAGb248b3a67 [2024-10-11 20:39:23,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/08518d400/09efbef90e464349b3d7d0e98e2a56ab [2024-10-11 20:39:23,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:39:23,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:39:23,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:39:23,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:39:23,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:39:23,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:23,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac6c557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23, skipping insertion in model container [2024-10-11 20:39:23,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:23,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:39:23,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:39:23,924 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:39:23,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:39:23,976 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:39:23,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23 WrapperNode [2024-10-11 20:39:23,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:39:23,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:39:23,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:39:23,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:39:23,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:23,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,013 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-11 20:39:24,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:39:24,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:39:24,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:39:24,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:39:24,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,055 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:39:24,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:39:24,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:39:24,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:39:24,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:39:24,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (1/1) ... [2024-10-11 20:39:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:39:24,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:24,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:39:24,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:39:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:39:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:39:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:39:24,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:39:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:39:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:39:24,222 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:39:24,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:39:24,558 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 20:39:24,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:39:24,590 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:39:24,591 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:39:24,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:39:24 BoogieIcfgContainer [2024-10-11 20:39:24,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:39:24,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:39:24,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:39:24,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:39:24,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:39:23" (1/3) ... [2024-10-11 20:39:24,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723ee21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:39:24, skipping insertion in model container [2024-10-11 20:39:24,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:23" (2/3) ... [2024-10-11 20:39:24,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723ee21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:39:24, skipping insertion in model container [2024-10-11 20:39:24,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:39:24" (3/3) ... [2024-10-11 20:39:24,602 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound100.c [2024-10-11 20:39:24,618 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:39:24,618 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:39:24,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:39:24,682 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;@12daef51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:39:24,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:39:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:39:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:39:24,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:24,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:39:24,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 123909867, now seen corresponding path program 1 times [2024-10-11 20:39:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532976191] [2024-10-11 20:39:24,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532976191] [2024-10-11 20:39:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532976191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:24,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:24,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:39:24,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855138573] [2024-10-11 20:39:24,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:24,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:39:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:39:24,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:39:24,855 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:24,882 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2024-10-11 20:39:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:39:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:39:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:24,889 INFO L225 Difference]: With dead ends: 64 [2024-10-11 20:39:24,889 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:39:24,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:39:24,895 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:24,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:39:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 20:39:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:39:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-11 20:39:24,931 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2024-10-11 20:39:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:24,932 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-11 20:39:24,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-11 20:39:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:39:24,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:24,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:39:24,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:39:24,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:24,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash 123969449, now seen corresponding path program 1 times [2024-10-11 20:39:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:24,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931844097] [2024-10-11 20:39:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:25,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931844097] [2024-10-11 20:39:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931844097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:25,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:25,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:39:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067997049] [2024-10-11 20:39:25,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:25,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:39:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:39:25,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:39:25,071 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:25,134 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-11 20:39:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:39:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:39:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:25,136 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:39:25,136 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:39:25,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:39:25,137 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:25,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:39:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 20:39:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:39:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-11 20:39:25,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 5 [2024-10-11 20:39:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:25,150 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-11 20:39:25,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-11 20:39:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:39:25,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:25,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:25,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:39:25,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:25,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1809310676, now seen corresponding path program 1 times [2024-10-11 20:39:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:25,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772607634] [2024-10-11 20:39:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:25,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772607634] [2024-10-11 20:39:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772607634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:25,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:25,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:39:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109132661] [2024-10-11 20:39:25,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:39:25,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:39:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:39:25,343 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:25,609 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-11 20:39:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:39:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:39:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:25,611 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:39:25,611 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:39:25,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:39:25,613 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:25,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:39:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:39:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-11 20:39:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-11 20:39:25,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 10 [2024-10-11 20:39:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:25,634 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-11 20:39:25,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-11 20:39:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:39:25,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:25,635 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:25,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:39:25,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1809309426, now seen corresponding path program 1 times [2024-10-11 20:39:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63795286] [2024-10-11 20:39:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63795286] [2024-10-11 20:39:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63795286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104993749] [2024-10-11 20:39:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:25,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:25,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:25,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:25,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:39:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:25,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:39:25,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:25,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104993749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 20:39:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950798825] [2024-10-11 20:39:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:25,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:39:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:39:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:39:25,896 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:25,933 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-10-11 20:39:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:39:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:39:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:25,935 INFO L225 Difference]: With dead ends: 57 [2024-10-11 20:39:25,935 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:39:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:39:25,937 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:25,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:39:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-11 20:39:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-11 20:39:25,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 10 [2024-10-11 20:39:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:25,966 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-11 20:39:25,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-11 20:39:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:39:25,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:25,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:25,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:26,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:26,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:26,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -254056039, now seen corresponding path program 1 times [2024-10-11 20:39:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062925540] [2024-10-11 20:39:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062925540] [2024-10-11 20:39:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062925540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:39:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915776332] [2024-10-11 20:39:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:26,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:39:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:39:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:39:26,289 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:26,356 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-11 20:39:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:39:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:39:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:26,357 INFO L225 Difference]: With dead ends: 57 [2024-10-11 20:39:26,358 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:39:26,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:39:26,359 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:26,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:39:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-11 20:39:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-10-11 20:39:26,368 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 11 [2024-10-11 20:39:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:26,368 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-10-11 20:39:26,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-10-11 20:39:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:39:26,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:26,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:26,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:39:26,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash -254017310, now seen corresponding path program 1 times [2024-10-11 20:39:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633775137] [2024-10-11 20:39:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633775137] [2024-10-11 20:39:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633775137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893976229] [2024-10-11 20:39:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:26,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:26,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:26,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:39:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:26,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:39:26,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:26,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893976229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 20:39:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272480585] [2024-10-11 20:39:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:39:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:39:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:39:26,581 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:26,654 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-11 20:39:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:39:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:39:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:26,656 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:39:26,657 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:39:26,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:39:26,659 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:26,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:39:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-11 20:39:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-11 20:39:26,674 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2024-10-11 20:39:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:26,675 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-11 20:39:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-11 20:39:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:39:26,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:26,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:26,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:26,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 302744435, now seen corresponding path program 1 times [2024-10-11 20:39:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117852843] [2024-10-11 20:39:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117852843] [2024-10-11 20:39:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117852843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387008002] [2024-10-11 20:39:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:26,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:26,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:26,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:39:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:26,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:39:26,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:27,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387008002] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:27,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-11 20:39:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738296065] [2024-10-11 20:39:27,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:27,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:39:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:39:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:39:27,094 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:27,216 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-10-11 20:39:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:39:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:39:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:27,221 INFO L225 Difference]: With dead ends: 92 [2024-10-11 20:39:27,221 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 20:39:27,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:39:27,222 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:27,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:39:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 20:39:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-11 20:39:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-10-11 20:39:27,236 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 14 [2024-10-11 20:39:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:27,236 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-10-11 20:39:27,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-10-11 20:39:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:39:27,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:27,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:27,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:39:27,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:27,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:27,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:27,439 INFO L85 PathProgramCache]: Analyzing trace with hash 795193831, now seen corresponding path program 1 times [2024-10-11 20:39:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:27,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39120317] [2024-10-11 20:39:27,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:27,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:27,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39120317] [2024-10-11 20:39:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39120317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:27,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326727876] [2024-10-11 20:39:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:27,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:27,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:27,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:39:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:27,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:39:27,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:27,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326727876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:27,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-11 20:39:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174043030] [2024-10-11 20:39:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:27,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:39:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:39:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:39:27,670 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:27,747 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-11 20:39:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:39:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:39:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:27,749 INFO L225 Difference]: With dead ends: 64 [2024-10-11 20:39:27,749 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 20:39:27,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:39:27,750 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:27,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:39:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 20:39:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-11 20:39:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:39:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-11 20:39:27,766 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 15 [2024-10-11 20:39:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:27,767 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-11 20:39:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-11 20:39:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:39:27,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:27,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:27,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:39:27,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:27,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1118794946, now seen corresponding path program 1 times [2024-10-11 20:39:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160181864] [2024-10-11 20:39:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160181864] [2024-10-11 20:39:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160181864] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27362756] [2024-10-11 20:39:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:28,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:28,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:39:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:28,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:39:28,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:28,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27362756] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:28,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-10-11 20:39:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582552810] [2024-10-11 20:39:28,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:28,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:39:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:39:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:39:28,262 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:28,652 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-10-11 20:39:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 20:39:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:39:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:28,654 INFO L225 Difference]: With dead ends: 86 [2024-10-11 20:39:28,654 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 20:39:28,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:39:28,655 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:28,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:39:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 20:39:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-10-11 20:39:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 20:39:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-11 20:39:28,665 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 16 [2024-10-11 20:39:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-11 20:39:28,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-11 20:39:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 20:39:28,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:28,669 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:39:28,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:39:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:28,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1351280755, now seen corresponding path program 1 times [2024-10-11 20:39:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040683078] [2024-10-11 20:39:28,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:39:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:39:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:39:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:39:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:39:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:39:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 20:39:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:39:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:39:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:39:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 20:39:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 20:39:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:39:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:29,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040683078] [2024-10-11 20:39:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040683078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083504021] [2024-10-11 20:39:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:29,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:29,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:29,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:29,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:39:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:29,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:39:29,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 20:39:29,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:39:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083504021] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:30,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2024-10-11 20:39:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424213603] [2024-10-11 20:39:30,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:30,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 20:39:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 20:39:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 20:39:30,075 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 20:39:35,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:39:37,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:39:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:37,282 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2024-10-11 20:39:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 20:39:37,283 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 93 [2024-10-11 20:39:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:37,285 INFO L225 Difference]: With dead ends: 236 [2024-10-11 20:39:37,286 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 20:39:37,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1016, Invalid=3144, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 20:39:37,293 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 264 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:37,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 299 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2024-10-11 20:39:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 20:39:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2024-10-11 20:39:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.135135135135135) internal successors, (126), 111 states have internal predecessors, (126), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 20:39:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 234 transitions. [2024-10-11 20:39:37,334 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 234 transitions. Word has length 93 [2024-10-11 20:39:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:37,337 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 234 transitions. [2024-10-11 20:39:37,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 20:39:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 234 transitions. [2024-10-11 20:39:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 20:39:37,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:37,350 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-11 20:39:37,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:39:37,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:39:37,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:37,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash 958093722, now seen corresponding path program 2 times [2024-10-11 20:39:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:37,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590464197] [2024-10-11 20:39:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:39:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:39:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:39:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:39:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:39:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:39:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:39:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:39:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:39:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 20:39:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 20:39:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 20:39:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:39:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:39:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:39:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 20:39:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 20:39:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:39:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:39:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 20:39:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 20:39:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 20:39:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 20:39:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 20:39:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 20:39:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 20:39:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 20:39:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:39:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 20:39:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 20:39:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:39:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:39:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 20:39:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-11 20:39:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:39:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:39:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 20:39:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590464197] [2024-10-11 20:39:38,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590464197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522805556] [2024-10-11 20:39:38,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:39:38,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:38,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:38,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:38,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:39:38,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:39:38,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:39:38,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 20:39:38,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 2388 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-11 20:39:39,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 20:39:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522805556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:40,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2024-10-11 20:39:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427336363] [2024-10-11 20:39:40,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 20:39:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 20:39:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 20:39:40,166 INFO L87 Difference]: Start difference. First operand 175 states and 234 transitions. Second operand has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-11 20:39:42,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:39:44,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:39:49,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:39:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:49,873 INFO L93 Difference]: Finished difference Result 592 states and 805 transitions. [2024-10-11 20:39:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-11 20:39:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) Word has length 242 [2024-10-11 20:39:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:49,882 INFO L225 Difference]: With dead ends: 592 [2024-10-11 20:39:49,884 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 20:39:49,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2197, Invalid=7309, Unknown=0, NotChecked=0, Total=9506 [2024-10-11 20:39:49,889 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 440 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:49,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 287 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 415 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2024-10-11 20:39:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 20:39:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 276. [2024-10-11 20:39:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 20:39:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 374 transitions. [2024-10-11 20:39:49,941 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 374 transitions. Word has length 242 [2024-10-11 20:39:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 374 transitions. [2024-10-11 20:39:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-11 20:39:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 374 transitions. [2024-10-11 20:39:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-11 20:39:49,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:49,947 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-11 20:39:49,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:39:50,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:50,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1972813965, now seen corresponding path program 1 times [2024-10-11 20:39:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:50,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491076426] [2024-10-11 20:39:50,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:39:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:39:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 20:39:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:39:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:39:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 20:39:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:39:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:39:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:39:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 20:39:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:39:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:39:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 20:39:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 20:39:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 20:39:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 20:39:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 20:39:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 20:39:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 20:39:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 20:39:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:39:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 20:39:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 20:39:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 20:39:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 20:39:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 20:39:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 20:39:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 20:39:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 20:39:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-11 20:39:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 20:39:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-11 20:39:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 20:39:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 20:39:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-11 20:39:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:50,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 20:39:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-11 20:39:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:51,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491076426] [2024-10-11 20:39:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491076426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338658064] [2024-10-11 20:39:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:51,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:51,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:51,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:51,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:39:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:51,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 20:39:51,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-11 20:39:51,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-11 20:39:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338658064] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:51,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 41 [2024-10-11 20:39:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375825743] [2024-10-11 20:39:51,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:51,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 20:39:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 20:39:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 20:39:51,845 INFO L87 Difference]: Start difference. First operand 276 states and 374 transitions. Second operand has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:39:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:52,658 INFO L93 Difference]: Finished difference Result 489 states and 648 transitions. [2024-10-11 20:39:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-11 20:39:52,659 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 266 [2024-10-11 20:39:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:52,661 INFO L225 Difference]: With dead ends: 489 [2024-10-11 20:39:52,661 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 20:39:52,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1752, Invalid=3798, Unknown=0, NotChecked=0, Total=5550 [2024-10-11 20:39:52,667 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 352 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:52,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 181 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:39:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 20:39:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 325. [2024-10-11 20:39:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 226 states have (on average 1.1504424778761062) internal successors, (260), 226 states have internal predecessors, (260), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 20:39:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 428 transitions. [2024-10-11 20:39:52,697 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 428 transitions. Word has length 266 [2024-10-11 20:39:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:52,698 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 428 transitions. [2024-10-11 20:39:52,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:39:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 428 transitions. [2024-10-11 20:39:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-11 20:39:52,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:52,702 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-11 20:39:52,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:39:52,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:39:52,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:52,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 279119509, now seen corresponding path program 3 times [2024-10-11 20:39:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833889251] [2024-10-11 20:39:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:39:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:39:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:39:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:39:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:39:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:39:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 20:39:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 20:39:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 20:39:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 20:39:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:39:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:39:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:39:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 20:39:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:39:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 20:39:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 20:39:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 20:39:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 20:39:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 20:39:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 20:39:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 20:39:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 20:39:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 20:39:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 20:39:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 20:39:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 20:39:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-11 20:39:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-11 20:39:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 20:39:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:39:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:39:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 20:39:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 20:39:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:39:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 20:39:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 20:39:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833889251] [2024-10-11 20:39:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833889251] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94140977] [2024-10-11 20:39:54,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:39:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:54,376 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:54,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:39:54,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:39:54,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:39:54,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:39:54,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2024-10-11 20:39:54,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94140977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [34] total 37 [2024-10-11 20:39:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103682359] [2024-10-11 20:39:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:39:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:39:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 20:39:54,616 INFO L87 Difference]: Start difference. First operand 325 states and 428 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 20:39:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:54,736 INFO L93 Difference]: Finished difference Result 333 states and 436 transitions. [2024-10-11 20:39:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:39:54,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 267 [2024-10-11 20:39:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:54,737 INFO L225 Difference]: With dead ends: 333 [2024-10-11 20:39:54,737 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:39:54,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 20:39:54,740 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:54,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:39:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:39:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:39:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:39:54,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2024-10-11 20:39:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:54,741 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:39:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 20:39:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:39:54,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:39:54,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:39:54,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:39:54,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:39:54,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:39:54,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:39:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:54,950 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:54,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:39:56,241 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:39:56,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:39:56 BoogieIcfgContainer [2024-10-11 20:39:56,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:39:56,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:39:56,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:39:56,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:39:56,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:39:24" (3/4) ... [2024-10-11 20:39:56,262 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:39:56,265 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:39:56,269 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 20:39:56,270 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:39:56,270 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:39:56,270 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:39:56,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:39:56,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:39:56,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:39:56,361 INFO L158 Benchmark]: Toolchain (without parser) took 32675.62ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 115.2MB in the beginning and 80.9MB in the end (delta: 34.3MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-10-11 20:39:56,361 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 148.9MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:39:56,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.13ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 102.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:39:56,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.20ms. Allocated memory is still 148.9MB. Free memory was 101.3MB in the beginning and 100.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:39:56,362 INFO L158 Benchmark]: Boogie Preprocessor took 48.72ms. Allocated memory is still 148.9MB. Free memory was 100.0MB in the beginning and 98.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:39:56,363 INFO L158 Benchmark]: RCFGBuilder took 524.79ms. Allocated memory is still 148.9MB. Free memory was 98.4MB in the beginning and 110.9MB in the end (delta: -12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:39:56,363 INFO L158 Benchmark]: TraceAbstraction took 31665.14ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 110.9MB in the beginning and 86.1MB in the end (delta: 24.8MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2024-10-11 20:39:56,363 INFO L158 Benchmark]: Witness Printer took 101.46ms. Allocated memory is still 218.1MB. Free memory was 86.1MB in the beginning and 80.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:39:56,365 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 148.9MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.13ms. Allocated memory is still 148.9MB. Free memory was 115.2MB in the beginning and 102.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.20ms. Allocated memory is still 148.9MB. Free memory was 101.3MB in the beginning and 100.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.72ms. Allocated memory is still 148.9MB. Free memory was 100.0MB in the beginning and 98.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.79ms. Allocated memory is still 148.9MB. Free memory was 98.4MB in the beginning and 110.9MB in the end (delta: -12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31665.14ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 110.9MB in the beginning and 86.1MB in the end (delta: 24.8MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. * Witness Printer took 101.46ms. Allocated memory is still 218.1MB. Free memory was 86.1MB in the beginning and 80.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1311 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 1853 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1496 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 357 mSDtfsCounter, 1392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2068 GetRequests, 1701 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5549 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 479 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1899 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4683 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1633 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 19649/23648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((0 <= ((long long) counter + 2147483647)) && (counter <= 100)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((counter <= 2147483641) && (0 <= ((long long) counter + 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:39:56,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE