./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c --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/nla-digbench-scaling/hard-u_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:31:09,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:31:09,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:31:09,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:31:09,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:31:09,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:31:09,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:31:09,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:31:09,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:31:09,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:31:09,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:31:09,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:31:09,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:31:09,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:31:09,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:31:09,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:31:09,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:31:09,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:31:09,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:31:09,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:31:09,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:31:09,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:31:09,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:31:09,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:31:09,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:31:09,632 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:31:09,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:31:09,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:31:09,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:31:09,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:31:09,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:31:09,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:31:09,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:31:09,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:31:09,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:31:09,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:31:09,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:31:09,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:31:09,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:31:09,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:31:09,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:31:09,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:31:09,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:31:09,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:31:09,638 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 -> 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 [2024-11-12 17:31:09,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:31:09,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:31:09,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:31:09,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:31:09,919 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:31:09,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2024-11-12 17:31:11,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:31:11,522 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:31:11,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2024-11-12 17:31:11,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598f7e4d6/e0dabe05e12947478d9a4e4f1f410217/FLAG8ff6fcdb5 [2024-11-12 17:31:11,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598f7e4d6/e0dabe05e12947478d9a4e4f1f410217 [2024-11-12 17:31:11,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:31:11,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:31:11,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:31:11,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:31:11,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:31:11,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:31:11" (1/1) ... [2024-11-12 17:31:11,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6a0198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:11, skipping insertion in model container [2024-11-12 17:31:11,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:31:11" (1/1) ... [2024-11-12 17:31:11,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:31:12,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:31:12,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:31:12,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:31:12,172 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:31:12,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12 WrapperNode [2024-11-12 17:31:12,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:31:12,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:31:12,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:31:12,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:31:12,181 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:31:12" (1/1) ... [2024-11-12 17:31:12,187 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:31:12" (1/1) ... [2024-11-12 17:31:12,205 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-12 17:31:12,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:31:12,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:31:12,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:31:12,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:31:12,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,225 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:31:12,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:31:12,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:31:12,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:31:12,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:31:12,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (1/1) ... [2024-11-12 17:31:12,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:31:12,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:12,277 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:31:12,280 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:31:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:31:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:31:12,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:31:12,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:31:12,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 17:31:12,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 17:31:12,389 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:31:12,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:31:12,527 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 17:31:12,527 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:31:12,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:31:12,543 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 17:31:12,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:31:12 BoogieIcfgContainer [2024-11-12 17:31:12,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:31:12,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:31:12,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:31:12,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:31:12,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:31:11" (1/3) ... [2024-11-12 17:31:12,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbbe4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:31:12, skipping insertion in model container [2024-11-12 17:31:12,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:31:12" (2/3) ... [2024-11-12 17:31:12,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbbe4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:31:12, skipping insertion in model container [2024-11-12 17:31:12,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:31:12" (3/3) ... [2024-11-12 17:31:12,553 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.c [2024-11-12 17:31:12,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:31:12,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 17:31:12,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:31:12,621 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;@29d22150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:31:12,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 17:31:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 17:31:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:31:12,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:12,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:31:12,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:12,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-12 17:31:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146936973] [2024-11-12 17:31:12,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:12,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:12,763 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:31:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146936973] [2024-11-12 17:31:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146936973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:31:12,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:31:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118381814] [2024-11-12 17:31:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:12,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 17:31:12,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 17:31:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:31:12,815 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:31:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:12,840 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-12 17:31:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 17:31:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:31:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:12,847 INFO L225 Difference]: With dead ends: 68 [2024-11-12 17:31:12,847 INFO L226 Difference]: Without dead ends: 28 [2024-11-12 17:31:12,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:31:12,852 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:12,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:31:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-12 17:31:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-12 17:31:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 17:31:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-12 17:31:12,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2024-11-12 17:31:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:12,887 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-12 17:31:12,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:31:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-12 17:31:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:31:12,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:12,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:31:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:31:12,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-12 17:31:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747450613] [2024-11-12 17:31:12,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:12,990 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:31:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747450613] [2024-11-12 17:31:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747450613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:31:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:31:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294507265] [2024-11-12 17:31:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:31:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:31:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:31:12,995 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 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:31:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:13,064 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-12 17:31:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:31:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 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:31:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:13,066 INFO L225 Difference]: With dead ends: 37 [2024-11-12 17:31:13,066 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 17:31:13,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:31:13,068 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:13,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:31:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 17:31:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-12 17:31:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 17:31:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-12 17:31:13,080 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2024-11-12 17:31:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:13,081 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-12 17:31:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:31:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-12 17:31:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 17:31:13,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:13,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:31:13,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:13,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-12 17:31:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706983760] [2024-11-12 17:31:13,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,167 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:31:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706983760] [2024-11-12 17:31:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706983760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:31:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:31:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307970861] [2024-11-12 17:31:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:31:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:31:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:31:13,172 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:31:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:13,218 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-12 17:31:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:31:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-12 17:31:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:13,221 INFO L225 Difference]: With dead ends: 50 [2024-11-12 17:31:13,221 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 17:31:13,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:31:13,222 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 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:31:13,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:31:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 17:31:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 17:31:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 17:31:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-12 17:31:13,236 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2024-11-12 17:31:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:13,236 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-12 17:31:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:31:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-12 17:31:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 17:31:13,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:13,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:13,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:31:13,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1297109879, now seen corresponding path program 1 times [2024-11-12 17:31:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450244864] [2024-11-12 17:31:13,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450244864] [2024-11-12 17:31:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450244864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:31:13,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:31:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196623494] [2024-11-12 17:31:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:13,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:31:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:31:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:31:13,480 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:31:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:13,565 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-12 17:31:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:31:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-12 17:31:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:13,566 INFO L225 Difference]: With dead ends: 35 [2024-11-12 17:31:13,567 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 17:31:13,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:31:13,569 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:13,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:31:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 17:31:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 17:31:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 17:31:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-12 17:31:13,580 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2024-11-12 17:31:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:13,580 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-12 17:31:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:31:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-12 17:31:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 17:31:13,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:13,583 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:31:13,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1555700513, now seen corresponding path program 1 times [2024-11-12 17:31:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476180221] [2024-11-12 17:31:13,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:13,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476180221] [2024-11-12 17:31:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476180221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:31:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:31:13,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263777479] [2024-11-12 17:31:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:13,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:31:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:31:13,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:31:13,741 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:31:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:13,831 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-12 17:31:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:31:13,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-12 17:31:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:13,833 INFO L225 Difference]: With dead ends: 51 [2024-11-12 17:31:13,833 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 17:31:13,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:31:13,835 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:13,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:31:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 17:31:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-12 17:31:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:31:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-12 17:31:13,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2024-11-12 17:31:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-12 17:31:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:31:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-12 17:31:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 17:31:13,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:13,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:31:13,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1555664763, now seen corresponding path program 1 times [2024-11-12 17:31:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555693355] [2024-11-12 17:31:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:13,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555693355] [2024-11-12 17:31:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555693355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201868009] [2024-11-12 17:31:13,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:13,933 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:31:13,934 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:31:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:13,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:31:13,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:14,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:31:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201868009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:14,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:31:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-12 17:31:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814656029] [2024-11-12 17:31:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:31:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:31:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:31:14,097 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:31:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:14,157 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-12 17:31:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:31:14,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-12 17:31:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:14,158 INFO L225 Difference]: With dead ends: 49 [2024-11-12 17:31:14,158 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 17:31:14,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:31:14,159 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:14,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:31:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 17:31:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-12 17:31:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:31:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-12 17:31:14,166 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2024-11-12 17:31:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:14,166 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-12 17:31:14,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:31:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-12 17:31:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 17:31:14,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:14,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:14,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 17:31:14,369 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:31:14,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:14,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1040655112, now seen corresponding path program 1 times [2024-11-12 17:31:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693800669] [2024-11-12 17:31:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693800669] [2024-11-12 17:31:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693800669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258715853] [2024-11-12 17:31:14,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:14,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:14,526 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:31:14,534 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:31:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:14,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:31:14,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:14,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:31:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:31:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258715853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:31:14,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:31:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-12 17:31:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504234215] [2024-11-12 17:31:14,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:31:14,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 17:31:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:14,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 17:31:14,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:31:14,752 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 17:31:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:14,925 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-12 17:31:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 17:31:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2024-11-12 17:31:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:14,928 INFO L225 Difference]: With dead ends: 93 [2024-11-12 17:31:14,928 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 17:31:14,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-12 17:31:14,929 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:14,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:31:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 17:31:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2024-11-12 17:31:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 17:31:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-11-12 17:31:14,949 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2024-11-12 17:31:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:14,949 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-12 17:31:14,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 17:31:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-11-12 17:31:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 17:31:14,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:14,952 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:14,969 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:31:15,156 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:31:15,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 182070449, now seen corresponding path program 1 times [2024-11-12 17:31:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285740683] [2024-11-12 17:31:15,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:31:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:31:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:31:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285740683] [2024-11-12 17:31:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285740683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351996208] [2024-11-12 17:31:15,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:15,309 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:31:15,311 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:31:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:15,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:31:15,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 17:31:15,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:31:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:31:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351996208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:31:15,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:31:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-12 17:31:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535793825] [2024-11-12 17:31:15,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:31:15,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 17:31:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 17:31:15,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-12 17:31:15,599 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-12 17:31:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:15,956 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-12 17:31:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 17:31:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 43 [2024-11-12 17:31:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:15,958 INFO L225 Difference]: With dead ends: 133 [2024-11-12 17:31:15,958 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 17:31:15,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 17:31:15,959 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:15,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:31:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 17:31:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-12 17:31:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 17:31:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2024-11-12 17:31:15,983 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2024-11-12 17:31:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2024-11-12 17:31:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-12 17:31:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2024-11-12 17:31:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 17:31:15,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:15,987 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:16,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 17:31:16,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:16,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:16,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1955862377, now seen corresponding path program 2 times [2024-11-12 17:31:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897326914] [2024-11-12 17:31:16,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:31:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:31:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 17:31:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:31:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 17:31:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 17:31:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 17:31:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 17:31:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 17:31:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 17:31:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897326914] [2024-11-12 17:31:16,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897326914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:16,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203654826] [2024-11-12 17:31:16,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:31:16,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:16,466 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:31:16,467 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:31:16,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:31:16,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:31:16,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 17:31:16,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 17:31:16,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:31:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 17:31:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203654826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:31:17,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:31:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-12 17:31:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707797892] [2024-11-12 17:31:17,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:31:17,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 17:31:17,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 17:31:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 17:31:17,135 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-12 17:31:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:17,608 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-11-12 17:31:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-12 17:31:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2024-11-12 17:31:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:17,610 INFO L225 Difference]: With dead ends: 196 [2024-11-12 17:31:17,610 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 17:31:17,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2024-11-12 17:31:17,612 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:17,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 250 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:31:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 17:31:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 144. [2024-11-12 17:31:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 17:31:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2024-11-12 17:31:17,627 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2024-11-12 17:31:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:17,628 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2024-11-12 17:31:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-12 17:31:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2024-11-12 17:31:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 17:31:17,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:17,630 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:17,647 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:31:17,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:17,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1533400926, now seen corresponding path program 1 times [2024-11-12 17:31:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:17,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892276789] [2024-11-12 17:31:17,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:31:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:31:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 17:31:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:31:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 17:31:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 17:31:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:31:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 17:31:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 17:31:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 17:31:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 17:31:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 17:31:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892276789] [2024-11-12 17:31:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892276789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195290305] [2024-11-12 17:31:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:18,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:18,294 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:31:18,295 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:31:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:18,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 17:31:18,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 389 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:31:18,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:31:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 17:31:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195290305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:31:19,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:31:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2024-11-12 17:31:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102551396] [2024-11-12 17:31:19,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:31:19,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-12 17:31:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-12 17:31:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 17:31:19,137 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-12 17:31:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:20,282 INFO L93 Difference]: Finished difference Result 370 states and 444 transitions. [2024-11-12 17:31:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-12 17:31:20,283 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) Word has length 111 [2024-11-12 17:31:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:20,286 INFO L225 Difference]: With dead ends: 370 [2024-11-12 17:31:20,286 INFO L226 Difference]: Without dead ends: 369 [2024-11-12 17:31:20,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1659, Invalid=4661, Unknown=0, NotChecked=0, Total=6320 [2024-11-12 17:31:20,289 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 265 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:20,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 380 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 17:31:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-12 17:31:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 252. [2024-11-12 17:31:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.118279569892473) internal successors, (208), 186 states have internal predecessors, (208), 45 states have call successors, (45), 20 states have call predecessors, (45), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 17:31:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 298 transitions. [2024-11-12 17:31:20,329 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 298 transitions. Word has length 111 [2024-11-12 17:31:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:20,329 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 298 transitions. [2024-11-12 17:31:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-12 17:31:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 298 transitions. [2024-11-12 17:31:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-12 17:31:20,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:20,337 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:20,359 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:31:20,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 17:31:20,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1354925193, now seen corresponding path program 2 times [2024-11-12 17:31:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885199227] [2024-11-12 17:31:20,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:31:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:31:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 17:31:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:31:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 17:31:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 17:31:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 17:31:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 17:31:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 17:31:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 17:31:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:31:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 17:31:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 17:31:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 17:31:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 17:31:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 17:31:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 17:31:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 17:31:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 17:31:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 17:31:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 17:31:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 17:31:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 17:31:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-12 17:31:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-12 17:31:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-12 17:31:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 17:31:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:21,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885199227] [2024-11-12 17:31:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885199227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891541612] [2024-11-12 17:31:21,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:31:21,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:21,703 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:31:21,705 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:31:21,811 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:31:21,811 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:31:21,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 17:31:21,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-12 17:31:22,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:31:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 17:31:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891541612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:31:23,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:31:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 29] total 57 [2024-11-12 17:31:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940324070] [2024-11-12 17:31:23,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:31:23,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-12 17:31:23,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:23,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-12 17:31:23,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2024-11-12 17:31:23,052 INFO L87 Difference]: Start difference. First operand 252 states and 298 transitions. Second operand has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-12 17:31:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:24,869 INFO L93 Difference]: Finished difference Result 762 states and 904 transitions. [2024-11-12 17:31:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-12 17:31:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) Word has length 227 [2024-11-12 17:31:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:24,878 INFO L225 Difference]: With dead ends: 762 [2024-11-12 17:31:24,879 INFO L226 Difference]: Without dead ends: 761 [2024-11-12 17:31:24,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3474 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3562, Invalid=10244, Unknown=0, NotChecked=0, Total=13806 [2024-11-12 17:31:24,884 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 421 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:24,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 349 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 17:31:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-12 17:31:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 356. [2024-11-12 17:31:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 261 states have internal predecessors, (293), 65 states have call successors, (65), 29 states have call predecessors, (65), 29 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-12 17:31:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2024-11-12 17:31:24,923 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 227 [2024-11-12 17:31:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:24,924 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2024-11-12 17:31:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-12 17:31:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2024-11-12 17:31:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-12 17:31:24,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:31:24,930 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:24,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 17:31:25,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:25,131 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 17:31:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:31:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -721746986, now seen corresponding path program 3 times [2024-11-12 17:31:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:31:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677642937] [2024-11-12 17:31:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:31:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:31:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:31:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:31:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-12 17:31:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:31:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:31:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 17:31:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:31:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 17:31:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 17:31:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 17:31:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 17:31:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 17:31:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 17:31:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 17:31:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:31:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 17:31:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 17:31:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 17:31:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 17:31:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 17:31:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:31:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 17:31:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-12 17:31:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-12 17:31:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-12 17:31:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-12 17:31:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-12 17:31:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 17:31:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 17:31:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-12 17:31:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-12 17:31:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-12 17:31:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-12 17:31:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-12 17:31:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:31:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 521 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 17:31:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:31:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677642937] [2024-11-12 17:31:26,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677642937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:31:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24376306] [2024-11-12 17:31:26,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 17:31:26,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:31:26,479 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:31:26,480 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:31:26,560 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-12 17:31:26,560 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:31:26,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:31:26,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:31:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 2426 trivial. 0 not checked. [2024-11-12 17:31:26,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:31:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24376306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:31:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:31:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-12 17:31:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848100262] [2024-11-12 17:31:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:31:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:31:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:31:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:31:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2024-11-12 17:31:26,660 INFO L87 Difference]: Start difference. First operand 356 states and 423 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-12 17:31:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:31:26,745 INFO L93 Difference]: Finished difference Result 364 states and 431 transitions. [2024-11-12 17:31:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:31:26,746 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 263 [2024-11-12 17:31:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:31:26,747 INFO L225 Difference]: With dead ends: 364 [2024-11-12 17:31:26,747 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:31:26,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2024-11-12 17:31:26,752 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:31:26,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:31:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:31:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:31:26,753 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:31:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:31:26,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2024-11-12 17:31:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:31:26,754 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:31:26,754 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-12 17:31:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:31:26,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:31:26,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 17:31:26,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 17:31:26,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 17:31:26,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 17:31:26,774 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:31:26,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:31:26,965 INFO L421 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:31:26,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:31:28,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:31:28,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:31:28 BoogieIcfgContainer [2024-11-12 17:31:28,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:31:28,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:31:28,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:31:28,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:31:28,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:31:12" (3/4) ... [2024-11-12 17:31:28,241 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:31:28,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 17:31:28,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-12 17:31:28,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:31:28,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:31:28,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:31:28,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:31:28,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:31:28,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:31:28,339 INFO L158 Benchmark]: Toolchain (without parser) took 16414.41ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 95.0MB in the beginning and 170.8MB in the end (delta: -75.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-11-12 17:31:28,339 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:31:28,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.60ms. Allocated memory is still 151.0MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:31:28,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 151.0MB. Free memory was 82.1MB in the beginning and 80.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:31:28,339 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 151.0MB. Free memory was 80.7MB in the beginning and 78.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:31:28,340 INFO L158 Benchmark]: RCFGBuilder took 302.54ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 66.0MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 17:31:28,340 INFO L158 Benchmark]: TraceAbstraction took 15690.81ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 65.4MB in the beginning and 176.0MB in the end (delta: -110.6MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. [2024-11-12 17:31:28,340 INFO L158 Benchmark]: Witness Printer took 100.49ms. Allocated memory is still 276.8MB. Free memory was 176.0MB in the beginning and 170.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:31:28,341 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.18ms. Allocated memory is still 151.0MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.60ms. Allocated memory is still 151.0MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 151.0MB. Free memory was 82.1MB in the beginning and 80.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 151.0MB. Free memory was 80.7MB in the beginning and 78.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 302.54ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 66.0MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15690.81ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 65.4MB in the beginning and 176.0MB in the end (delta: -110.6MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. * Witness Printer took 100.49ms. Allocated memory is still 276.8MB. Free memory was 176.0MB in the beginning and 170.8MB 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: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 12, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 1810 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1484 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 326 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1404 SyntacticMatches, 0 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=11, InterpolantAutomatonStates: 258, 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, 12 MinimizatonAttempts, 583 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4471 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1387 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 9890/14155 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 20)) || (counter == 0)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483637)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:31:28,365 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