./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:01:25,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:01:25,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:01:25,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:01:25,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:01:25,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:01:25,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:01:25,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:01:25,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:01:25,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:01:25,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:01:25,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:01:25,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:01:25,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:01:25,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:01:25,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:01:25,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:01:25,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:01:25,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:01:25,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:01:25,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:01:25,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:01:25,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:01:25,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:01:25,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:01:25,478 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:01:25,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:01:25,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:01:25,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:01:25,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:01:25,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:01:25,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:01:25,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:01:25,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:01:25,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:01:25,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:01:25,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:01:25,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:01:25,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:01:25,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:01:25,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:01:25,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:01:25,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:01:25,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:01:25,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2024-11-12 17:01:25,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:01:25,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:01:25,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:01:25,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:01:25,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:01:25,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2024-11-12 17:01:27,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:01:27,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:01:27,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2024-11-12 17:01:27,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26578b759/2bbb7eb7269c4a36a8de7c52a027dba8/FLAG872696dbb [2024-11-12 17:01:27,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26578b759/2bbb7eb7269c4a36a8de7c52a027dba8 [2024-11-12 17:01:27,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:01:27,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:01:27,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:01:27,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:01:27,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:01:27,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1e8e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27, skipping insertion in model container [2024-11-12 17:01:27,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:01:27,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:01:27,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:01:27,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:01:27,567 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:01:27,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27 WrapperNode [2024-11-12 17:01:27,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:01:27,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:01:27,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:01:27,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:01:27,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,599 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-11-12 17:01:27,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:01:27,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:01:27,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:01:27,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:01:27,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,623 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-11-12 17:01:27,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:01:27,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:01:27,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:01:27,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:01:27,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (1/1) ... [2024-11-12 17:01:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:01:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:27,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:01:27,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:01:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:01:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:01:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:01:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:01:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 17:01:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 17:01:27,776 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:01:27,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:01:27,944 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-12 17:01:27,945 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:01:27,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:01:27,955 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 17:01:27,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:27 BoogieIcfgContainer [2024-11-12 17:01:27,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:01:27,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:01:27,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:01:27,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:01:27,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:01:27" (1/3) ... [2024-11-12 17:01:27,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af4cced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:27, skipping insertion in model container [2024-11-12 17:01:27,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:27" (2/3) ... [2024-11-12 17:01:27,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af4cced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:27, skipping insertion in model container [2024-11-12 17:01:27,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:27" (3/3) ... [2024-11-12 17:01:27,962 INFO L112 eAbstractionObserver]: Analyzing ICFG id_build.i [2024-11-12 17:01:27,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:01:27,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-12 17:01:28,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:01:28,024 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;@19a5edd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:01:28,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-12 17:01:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 39 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:01:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 17:01:28,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:28,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 17:01:28,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:28,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 28698920, now seen corresponding path program 1 times [2024-11-12 17:01:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508162639] [2024-11-12 17:01:28,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:01:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508162639] [2024-11-12 17:01:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508162639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:28,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:01:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055514239] [2024-11-12 17:01:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:28,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:01:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:28,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:01:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:28,264 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 39 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-12 17:01:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:28,383 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2024-11-12 17:01:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:01:28,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-12 17:01:28,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:28,390 INFO L225 Difference]: With dead ends: 101 [2024-11-12 17:01:28,391 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 17:01:28,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-12 17:01:28,395 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:28,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 57 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:01:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 17:01:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-12 17:01:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:01:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-12 17:01:28,430 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 5 [2024-11-12 17:01:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:28,431 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-12 17:01:28,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-12 17:01:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-12 17:01:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:01:28,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:28,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:01:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:01:28,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:28,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 889665482, now seen corresponding path program 1 times [2024-11-12 17:01:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139221719] [2024-11-12 17:01:28,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:01:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139221719] [2024-11-12 17:01:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139221719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:28,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:28,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:01:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691722517] [2024-11-12 17:01:28,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:28,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:01:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:01:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:28,491 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 17:01:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:28,516 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2024-11-12 17:01:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:01:28,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-12 17:01:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:28,518 INFO L225 Difference]: With dead ends: 111 [2024-11-12 17:01:28,519 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 17:01:28,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:28,521 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:28,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 17:01:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 51. [2024-11-12 17:01:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5) internal successors, (54), 45 states have internal predecessors, (54), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:01:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-12 17:01:28,534 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 6 [2024-11-12 17:01:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-12 17:01:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 17:01:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-12 17:01:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:01:28,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:28,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:01:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:01:28,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:28,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash 889666572, now seen corresponding path program 1 times [2024-11-12 17:01:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598392114] [2024-11-12 17:01:28,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:01:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598392114] [2024-11-12 17:01:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598392114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:01:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108902631] [2024-11-12 17:01:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:01:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:01:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:28,576 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 17:01:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:28,598 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-12 17:01:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:01:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-12 17:01:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:28,600 INFO L225 Difference]: With dead ends: 51 [2024-11-12 17:01:28,600 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 17:01:28,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:28,601 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:28,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 17:01:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 17:01:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 43 states have internal predecessors, (50), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:01:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-12 17:01:28,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 6 [2024-11-12 17:01:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:28,609 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-12 17:01:28,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-12 17:01:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-12 17:01:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 17:01:28,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:28,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:28,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:01:28,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:28,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 271085518, now seen corresponding path program 1 times [2024-11-12 17:01:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:28,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284700843] [2024-11-12 17:01:28,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:01:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:28,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284700843] [2024-11-12 17:01:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284700843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:28,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:01:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116936006] [2024-11-12 17:01:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:28,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:01:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:28,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:01:28,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:28,680 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-12 17:01:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:28,727 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-11-12 17:01:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:01:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-12 17:01:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:28,729 INFO L225 Difference]: With dead ends: 54 [2024-11-12 17:01:28,729 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 17:01:28,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:28,730 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:28,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 17:01:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-12 17:01:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:01:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-12 17:01:28,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 8 [2024-11-12 17:01:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:28,744 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-12 17:01:28,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-12 17:01:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-12 17:01:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 17:01:28,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:28,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:28,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:01:28,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash -420518096, now seen corresponding path program 1 times [2024-11-12 17:01:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:28,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237416655] [2024-11-12 17:01:28,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:01:28,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237416655] [2024-11-12 17:01:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237416655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:01:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997091982] [2024-11-12 17:01:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:01:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:01:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:28,873 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:28,902 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-12 17:01:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:01:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-12 17:01:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:28,904 INFO L225 Difference]: With dead ends: 81 [2024-11-12 17:01:28,904 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 17:01:28,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:28,905 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:28,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 17:01:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-11-12 17:01:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 65 states have internal predecessors, (74), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:01:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2024-11-12 17:01:28,914 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 24 [2024-11-12 17:01:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-11-12 17:01:28,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2024-11-12 17:01:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:01:28,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:28,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:28,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:01:28,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2052472808, now seen corresponding path program 1 times [2024-11-12 17:01:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088116041] [2024-11-12 17:01:28,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:01:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088116041] [2024-11-12 17:01:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088116041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931138475] [2024-11-12 17:01:28,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:28,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:28,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:28,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:28,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:01:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:01:29,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:01:29,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:01:29,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931138475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:01:29,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:01:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-12 17:01:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229728123] [2024-11-12 17:01:29,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 17:01:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 17:01:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:01:29,142 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:01:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:29,183 INFO L93 Difference]: Finished difference Result 157 states and 188 transitions. [2024-11-12 17:01:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:01:29,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2024-11-12 17:01:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:29,185 INFO L225 Difference]: With dead ends: 157 [2024-11-12 17:01:29,185 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 17:01:29,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:01:29,186 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:29,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 104 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 17:01:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2024-11-12 17:01:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 91 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:01:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2024-11-12 17:01:29,198 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 28 [2024-11-12 17:01:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:29,198 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2024-11-12 17:01:29,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:01:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2024-11-12 17:01:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 17:01:29,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:29,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:29,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 17:01:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 17:01:29,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1089058814, now seen corresponding path program 1 times [2024-11-12 17:01:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:29,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633778178] [2024-11-12 17:01:29,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 17:01:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633778178] [2024-11-12 17:01:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633778178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:29,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200958593] [2024-11-12 17:01:29,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:29,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:29,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:29,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:01:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:01:29,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 17:01:29,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:01:29,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200958593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:29,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:01:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-12 17:01:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057343650] [2024-11-12 17:01:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:29,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:01:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:01:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:01:29,644 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:01:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:29,676 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2024-11-12 17:01:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:01:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-12 17:01:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:29,681 INFO L225 Difference]: With dead ends: 105 [2024-11-12 17:01:29,681 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 17:01:29,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:01:29,682 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:29,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 17:01:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 17:01:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 90 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:01:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-11-12 17:01:29,699 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 46 [2024-11-12 17:01:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:29,700 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-11-12 17:01:29,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:01:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-11-12 17:01:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 17:01:29,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:29,703 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-11-12 17:01:29,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 17:01:29,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-12 17:01:29,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:29,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:29,905 INFO L85 PathProgramCache]: Analyzing trace with hash 788131708, now seen corresponding path program 1 times [2024-11-12 17:01:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:29,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314137555] [2024-11-12 17:01:29,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-12 17:01:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:29,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314137555] [2024-11-12 17:01:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314137555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:29,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:29,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:01:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749133141] [2024-11-12 17:01:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:01:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:01:29,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:29,992 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:01:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:30,012 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2024-11-12 17:01:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:01:30,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2024-11-12 17:01:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:30,013 INFO L225 Difference]: With dead ends: 104 [2024-11-12 17:01:30,013 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 17:01:30,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:30,014 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:30,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 17:01:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 17:01:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 89 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:01:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2024-11-12 17:01:30,033 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 69 [2024-11-12 17:01:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:30,034 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2024-11-12 17:01:30,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:01:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2024-11-12 17:01:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 17:01:30,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:30,035 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:30,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:01:30,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:30,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1354447564, now seen corresponding path program 2 times [2024-11-12 17:01:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:30,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853493506] [2024-11-12 17:01:30,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:30,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-12 17:01:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853493506] [2024-11-12 17:01:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853493506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:01:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003055344] [2024-11-12 17:01:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:30,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:01:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:01:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:30,147 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:30,180 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2024-11-12 17:01:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:01:30,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2024-11-12 17:01:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:30,182 INFO L225 Difference]: With dead ends: 108 [2024-11-12 17:01:30,182 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 17:01:30,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:01:30,183 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:30,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 17:01:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 17:01:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 92 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:01:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2024-11-12 17:01:30,193 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 72 [2024-11-12 17:01:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2024-11-12 17:01:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2024-11-12 17:01:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 17:01:30,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:30,199 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:30,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 17:01:30,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:30,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1586561008, now seen corresponding path program 1 times [2024-11-12 17:01:30,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:30,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675853418] [2024-11-12 17:01:30,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:30,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-12 17:01:30,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675853418] [2024-11-12 17:01:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675853418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:30,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:01:30,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:01:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263298477] [2024-11-12 17:01:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:30,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:01:30,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:01:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:30,258 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:30,279 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2024-11-12 17:01:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:01:30,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-12 17:01:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:30,281 INFO L225 Difference]: With dead ends: 106 [2024-11-12 17:01:30,281 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 17:01:30,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:01:30,282 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:30,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 17:01:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 17:01:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 90 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:01:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2024-11-12 17:01:30,295 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 78 [2024-11-12 17:01:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2024-11-12 17:01:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2024-11-12 17:01:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 17:01:30,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:30,296 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:30,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 17:01:30,296 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:30,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1938750936, now seen corresponding path program 1 times [2024-11-12 17:01:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:30,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196434243] [2024-11-12 17:01:30,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:01:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196434243] [2024-11-12 17:01:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196434243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580516203] [2024-11-12 17:01:30,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:30,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:30,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:30,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:01:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:30,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 17:01:30,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:01:30,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:01:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580516203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:01:30,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:01:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-12 17:01:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975362869] [2024-11-12 17:01:30,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:30,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 17:01:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 17:01:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-12 17:01:30,742 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 17:01:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:30,810 INFO L93 Difference]: Finished difference Result 286 states and 333 transitions. [2024-11-12 17:01:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 17:01:30,810 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 79 [2024-11-12 17:01:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:30,812 INFO L225 Difference]: With dead ends: 286 [2024-11-12 17:01:30,812 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 17:01:30,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-12 17:01:30,813 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:30,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 17:01:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 216. [2024-11-12 17:01:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 183 states have (on average 1.098360655737705) internal successors, (201), 186 states have internal predecessors, (201), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 17:01:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2024-11-12 17:01:30,824 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 79 [2024-11-12 17:01:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:30,825 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2024-11-12 17:01:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 17:01:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2024-11-12 17:01:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 17:01:30,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:30,826 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:30,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:01:31,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:31,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:31,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1271461616, now seen corresponding path program 2 times [2024-11-12 17:01:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448301375] [2024-11-12 17:01:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 17:01:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:01:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 17:01:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 17:01:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 17:01:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:01:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 17:01:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 17:01:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 17:01:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448301375] [2024-11-12 17:01:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448301375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236685953] [2024-11-12 17:01:31,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:01:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:31,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:31,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 17:01:31,371 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:01:31,371 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:01:31,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 17:01:31,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 17:01:31,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 17:01:31,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236685953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:01:31,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:01:31,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2024-11-12 17:01:31,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65377334] [2024-11-12 17:01:31,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:31,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 17:01:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 17:01:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-12 17:01:31,723 INFO L87 Difference]: Start difference. First operand 216 states and 257 transitions. Second operand has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 17:01:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:31,801 INFO L93 Difference]: Finished difference Result 372 states and 433 transitions. [2024-11-12 17:01:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 17:01:31,801 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 167 [2024-11-12 17:01:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:31,803 INFO L225 Difference]: With dead ends: 372 [2024-11-12 17:01:31,803 INFO L226 Difference]: Without dead ends: 258 [2024-11-12 17:01:31,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 345 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-12 17:01:31,804 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:31,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 203 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:01:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-12 17:01:31,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 244. [2024-11-12 17:01:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 207 states have (on average 1.0966183574879227) internal successors, (227), 210 states have internal predecessors, (227), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 17:01:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 291 transitions. [2024-11-12 17:01:31,816 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 291 transitions. Word has length 167 [2024-11-12 17:01:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:31,816 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 291 transitions. [2024-11-12 17:01:31,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 17:01:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 291 transitions. [2024-11-12 17:01:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 17:01:31,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:31,818 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:31,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 17:01:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:32,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:32,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -977530782, now seen corresponding path program 3 times [2024-11-12 17:01:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60998719] [2024-11-12 17:01:32,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 17:01:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:01:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 17:01:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 17:01:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 17:01:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:01:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 17:01:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 17:01:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-12 17:01:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 17:01:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2024-11-12 17:01:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60998719] [2024-11-12 17:01:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60998719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514869179] [2024-11-12 17:01:32,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 17:01:32,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:32,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:32,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 17:01:32,214 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 17:01:32,215 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:01:32,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:01:32,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2024-11-12 17:01:32,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:01:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514869179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:01:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:01:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-12 17:01:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370951845] [2024-11-12 17:01:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:01:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:01:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:01:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:01:32,531 INFO L87 Difference]: Start difference. First operand 244 states and 291 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:32,580 INFO L93 Difference]: Finished difference Result 244 states and 291 transitions. [2024-11-12 17:01:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:01:32,580 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 189 [2024-11-12 17:01:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:32,581 INFO L225 Difference]: With dead ends: 244 [2024-11-12 17:01:32,581 INFO L226 Difference]: Without dead ends: 241 [2024-11-12 17:01:32,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:01:32,582 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:32,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 62 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:01:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-12 17:01:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-12 17:01:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 207 states have (on average 1.0144927536231885) internal successors, (210), 207 states have internal predecessors, (210), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 17:01:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 274 transitions. [2024-11-12 17:01:32,593 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 274 transitions. Word has length 189 [2024-11-12 17:01:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:32,593 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 274 transitions. [2024-11-12 17:01:32,594 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:01:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 274 transitions. [2024-11-12 17:01:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-11-12 17:01:32,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:32,597 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 17:01:32,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 17:01:32,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 17:01:32,797 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:32,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1613768638, now seen corresponding path program 1 times [2024-11-12 17:01:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965162747] [2024-11-12 17:01:32,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 17:01:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:01:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 17:01:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 17:01:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 17:01:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:01:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 17:01:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 17:01:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-12 17:01:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 17:01:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-12 17:01:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 17:01:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-12 17:01:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-12 17:01:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-12 17:01:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-12 17:01:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-12 17:01:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-12 17:01:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-12 17:01:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-12 17:01:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-11-12 17:01:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-12 17:01:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-12 17:01:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-12 17:01:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-12 17:01:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-12 17:01:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-11-12 17:01:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965162747] [2024-11-12 17:01:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965162747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652242988] [2024-11-12 17:01:33,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:33,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:33,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:33,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:01:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:33,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:01:33,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-11-12 17:01:33,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3701 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-11-12 17:01:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652242988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:01:33,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:01:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-12 17:01:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170747137] [2024-11-12 17:01:33,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 17:01:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 17:01:33,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:01:33,717 INFO L87 Difference]: Start difference. First operand 241 states and 274 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-12 17:01:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:33,791 INFO L93 Difference]: Finished difference Result 593 states and 679 transitions. [2024-11-12 17:01:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 17:01:33,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 364 [2024-11-12 17:01:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:33,794 INFO L225 Difference]: With dead ends: 593 [2024-11-12 17:01:33,795 INFO L226 Difference]: Without dead ends: 592 [2024-11-12 17:01:33,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:01:33,796 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:33,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:01:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-12 17:01:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2024-11-12 17:01:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 510 states have (on average 1.011764705882353) internal successors, (516), 510 states have internal predecessors, (516), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 17:01:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 676 transitions. [2024-11-12 17:01:33,816 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 676 transitions. Word has length 364 [2024-11-12 17:01:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 676 transitions. [2024-11-12 17:01:33,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-12 17:01:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 676 transitions. [2024-11-12 17:01:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2024-11-12 17:01:33,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:01:33,829 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 5, 5, 5, 5, 4, 1, 1, 1] [2024-11-12 17:01:33,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 17:01:34,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:34,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-12 17:01:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:01:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 202783318, now seen corresponding path program 2 times [2024-11-12 17:01:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:01:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109451706] [2024-11-12 17:01:34,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:01:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:01:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:01:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 17:01:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-12 17:01:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:01:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 17:01:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:01:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 17:01:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:01:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 17:01:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 17:01:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 17:01:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:01:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 17:01:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 17:01:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-12 17:01:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 17:01:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-12 17:01:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 17:01:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-12 17:01:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-12 17:01:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-12 17:01:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-12 17:01:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-12 17:01:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-12 17:01:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-12 17:01:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-12 17:01:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-11-12 17:01:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-12 17:01:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-12 17:01:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-12 17:01:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-12 17:01:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-12 17:01:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-12 17:01:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-11-12 17:01:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-12 17:01:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2024-11-12 17:01:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-12 17:01:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 423 [2024-11-12 17:01:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2024-11-12 17:01:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2024-11-12 17:01:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-11-12 17:01:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-12 17:01:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2024-11-12 17:01:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-11-12 17:01:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2024-11-12 17:01:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-12 17:01:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-11-12 17:01:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-12 17:01:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2024-11-12 17:01:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-11-12 17:01:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 573 [2024-11-12 17:01:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2024-11-12 17:01:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-11-12 17:01:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 604 [2024-11-12 17:01:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2024-11-12 17:01:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 626 [2024-11-12 17:01:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 639 [2024-11-12 17:01:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 648 [2024-11-12 17:01:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 661 [2024-11-12 17:01:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2024-11-12 17:01:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2024-11-12 17:01:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 692 [2024-11-12 17:01:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 705 [2024-11-12 17:01:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 714 [2024-11-12 17:01:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 732 [2024-11-12 17:01:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 741 [2024-11-12 17:01:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 754 [2024-11-12 17:01:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 763 [2024-11-12 17:01:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 776 [2024-11-12 17:01:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2024-11-12 17:01:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 798 [2024-11-12 17:01:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 807 [2024-11-12 17:01:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 820 [2024-11-12 17:01:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 829 [2024-11-12 17:01:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-12 17:01:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-11-12 17:01:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 864 [2024-11-12 17:01:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 873 [2024-11-12 17:01:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 886 [2024-11-12 17:01:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 895 [2024-11-12 17:01:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:01:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23810 backedges. 0 proven. 9170 refuted. 0 times theorem prover too weak. 14640 trivial. 0 not checked. [2024-11-12 17:01:34,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:01:34,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109451706] [2024-11-12 17:01:34,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109451706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:01:34,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018827383] [2024-11-12 17:01:34,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:01:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:01:34,845 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:01:34,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:01:34,910 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 17:01:34,910 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:01:34,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:01:34,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:01:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23810 backedges. 0 proven. 3664 refuted. 0 times theorem prover too weak. 20146 trivial. 0 not checked. [2024-11-12 17:01:35,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:01:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 23810 backedges. 0 proven. 3664 refuted. 0 times theorem prover too weak. 20146 trivial. 0 not checked. [2024-11-12 17:01:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018827383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:01:36,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:01:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-12 17:01:36,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450606315] [2024-11-12 17:01:36,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:01:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 17:01:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:01:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 17:01:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-12 17:01:36,226 INFO L87 Difference]: Start difference. First operand 592 states and 676 transitions. Second operand has 15 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 17:01:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:01:36,407 INFO L93 Difference]: Finished difference Result 710 states and 812 transitions. [2024-11-12 17:01:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 17:01:36,407 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 907 [2024-11-12 17:01:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:01:36,409 INFO L225 Difference]: With dead ends: 710 [2024-11-12 17:01:36,409 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:01:36,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1968 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-12 17:01:36,411 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:01:36,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:01:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:01:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:01:36,411 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-11-12 17:01:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:01:36,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 907 [2024-11-12 17:01:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:01:36,412 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:01:36,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 17:01:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:01:36,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:01:36,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-12 17:01:36,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-12 17:01:36,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-12 17:01:36,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-12 17:01:36,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 17:01:36,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:01:36,620 INFO L421 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:01:36,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:01:37,852 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:01:37,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:01:37 BoogieIcfgContainer [2024-11-12 17:01:37,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:01:37,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:01:37,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:01:37,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:01:37,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:27" (3/4) ... [2024-11-12 17:01:37,870 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:01:37,873 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 17:01:37,878 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-12 17:01:37,878 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:01:37,878 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:01:37,878 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:01:37,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:01:37,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:01:37,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:01:37,984 INFO L158 Benchmark]: Toolchain (without parser) took 10621.52ms. Allocated memory was 180.4MB in the beginning and 415.2MB in the end (delta: 234.9MB). Free memory was 152.4MB in the beginning and 247.6MB in the end (delta: -95.1MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2024-11-12 17:01:37,984 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:01:37,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.64ms. Allocated memory is still 180.4MB. Free memory was 151.4MB in the beginning and 139.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:01:37,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.92ms. Allocated memory is still 180.4MB. Free memory was 139.2MB in the beginning and 138.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:01:37,984 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 180.4MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:01:37,985 INFO L158 Benchmark]: RCFGBuilder took 317.21ms. Allocated memory is still 180.4MB. Free memory was 136.0MB in the beginning and 146.9MB in the end (delta: -10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:01:37,985 INFO L158 Benchmark]: TraceAbstraction took 9909.99ms. Allocated memory was 180.4MB in the beginning and 415.2MB in the end (delta: 234.9MB). Free memory was 146.9MB in the beginning and 252.8MB in the end (delta: -106.0MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. [2024-11-12 17:01:37,985 INFO L158 Benchmark]: Witness Printer took 115.92ms. Allocated memory is still 415.2MB. Free memory was 252.8MB in the beginning and 247.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:01:37,986 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.64ms. Allocated memory is still 180.4MB. Free memory was 151.4MB in the beginning and 139.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.92ms. Allocated memory is still 180.4MB. Free memory was 139.2MB in the beginning and 138.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 180.4MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.21ms. Allocated memory is still 180.4MB. Free memory was 136.0MB in the beginning and 146.9MB in the end (delta: -10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9909.99ms. Allocated memory was 180.4MB in the beginning and 415.2MB in the end (delta: 234.9MB). Free memory was 146.9MB in the beginning and 252.8MB in the end (delta: -106.0MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. * Witness Printer took 115.92ms. Allocated memory is still 415.2MB. Free memory was 252.8MB in the beginning and 247.6MB 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 15, TraceHistogramMax: 80, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 1240 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 871 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 369 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3751 GetRequests, 3632 SyntacticMatches, 17 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=14, InterpolantAutomatonStates: 102, 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, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3828 NumberOfCodeBlocks, 2752 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5346 ConstructedInterpolants, 0 QuantifiedInterpolants, 12988 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1191 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 66923/87268 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 12 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((0 <= (j + 2147483648)) && (1 <= nlen)) && (i == 0)) && (nlen <= 2147483647)) || ((((0 <= (j + 2147483648)) && (1 <= i)) && (nlen <= 2147483647)) && (((long long) i + 1) <= nlen))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((i == 0) && (nlen <= 2147483647)) || (((1 <= nlen) && (1 <= i)) && (nlen <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:01:38,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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