./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.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 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:24:11,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:24:11,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:24:11,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:24:11,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:24:11,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:24:11,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:24:11,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:24:11,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:24:11,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:24:11,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:24:11,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:24:11,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:24:11,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:24:11,562 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:24:11,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:24:11,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:24:11,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:24:11,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:24:11,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:24:11,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:24:11,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:24:11,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:24:11,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:24:11,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:24:11,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:24:11,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:24:11,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:24:11,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:24:11,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:24:11,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:24:11,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:24:11,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:24:11,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:24:11,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:24:11,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:24:11,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:24:11,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:24:11,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:24:11,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:24:11,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:24:11,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:24:11,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:24:11,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:24:11,575 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 -> 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 [2024-10-13 13:24:11,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:24:11,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:24:11,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:24:11,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:24:11,827 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:24:11,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2024-10-13 13:24:13,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:24:13,506 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:24:13,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2024-10-13 13:24:13,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e030e183/7293deac60db4d1cad36b57267929264/FLAG475321602 [2024-10-13 13:24:13,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e030e183/7293deac60db4d1cad36b57267929264 [2024-10-13 13:24:13,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:24:13,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:24:13,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:24:13,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:24:13,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:24:13,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335e0abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13, skipping insertion in model container [2024-10-13 13:24:13,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:24:13,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:24:13,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:24:13,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:24:13,862 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:24:13,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13 WrapperNode [2024-10-13 13:24:13,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:24:13,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:24:13,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:24:13,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:24:13,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,913 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-13 13:24:13,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:24:13,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:24:13,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:24:13,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:24:13,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:24:13,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:13,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:24:13,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:24:13,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:24:13,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:24:13,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (1/1) ... [2024-10-13 13:24:14,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:24:14,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:14,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:24:14,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:24:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:24:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:24:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:24:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:24:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:24:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:24:14,188 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:24:14,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:24:14,462 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-13 13:24:14,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:24:14,495 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:24:14,496 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:24:14,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:14 BoogieIcfgContainer [2024-10-13 13:24:14,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:24:14,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:24:14,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:24:14,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:24:14,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:24:13" (1/3) ... [2024-10-13 13:24:14,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f87d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:24:14, skipping insertion in model container [2024-10-13 13:24:14,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:13" (2/3) ... [2024-10-13 13:24:14,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f87d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:24:14, skipping insertion in model container [2024-10-13 13:24:14,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:14" (3/3) ... [2024-10-13 13:24:14,507 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2024-10-13 13:24:14,525 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:24:14,525 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 13:24:14,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:24:14,590 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;@2bcd5fe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:24:14,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 13:24:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:24:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:24:14,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:14,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:24:14,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:14,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash 123909867, now seen corresponding path program 1 times [2024-10-13 13:24:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207992301] [2024-10-13 13:24:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:14,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:14,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207992301] [2024-10-13 13:24:14,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207992301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:14,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:24:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:24:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667882275] [2024-10-13 13:24:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:14,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:24:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:14,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:24:14,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:24:14,788 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:14,826 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2024-10-13 13:24:14,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:24:14,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:24:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:14,835 INFO L225 Difference]: With dead ends: 64 [2024-10-13 13:24:14,835 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:24:14,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:24:14,842 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:14,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:24:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:24:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 13:24:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 13:24:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-13 13:24:14,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2024-10-13 13:24:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:14,886 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-13 13:24:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-13 13:24:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:24:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:14,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:24:14,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:24:14,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:14,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash 123969449, now seen corresponding path program 1 times [2024-10-13 13:24:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669050920] [2024-10-13 13:24:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669050920] [2024-10-13 13:24:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669050920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:14,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:24:14,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:24:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634134078] [2024-10-13 13:24:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:14,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:24:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:24:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:24:14,990 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:15,051 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-13 13:24:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:24:15,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:24:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:15,053 INFO L225 Difference]: With dead ends: 52 [2024-10-13 13:24:15,053 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 13:24:15,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:24:15,057 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:15,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:24:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 13:24:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 13:24:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 13:24:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-13 13:24:15,067 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 5 [2024-10-13 13:24:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:15,068 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-13 13:24:15,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-13 13:24:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:24:15,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:15,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:15,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:24:15,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:15,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1809310676, now seen corresponding path program 1 times [2024-10-13 13:24:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:15,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325682163] [2024-10-13 13:24:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325682163] [2024-10-13 13:24:15,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325682163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:15,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:24:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:24:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211585467] [2024-10-13 13:24:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:15,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:24:15,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:24:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:24:15,255 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:15,480 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-13 13:24:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:24:15,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:24:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:15,482 INFO L225 Difference]: With dead ends: 56 [2024-10-13 13:24:15,483 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 13:24:15,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:24:15,486 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:15,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:24:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 13:24:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-13 13:24:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:24:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-13 13:24:15,498 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 10 [2024-10-13 13:24:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:15,498 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-13 13:24:15,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-13 13:24:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:24:15,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:15,499 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:24:15,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1809309426, now seen corresponding path program 1 times [2024-10-13 13:24:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918843165] [2024-10-13 13:24:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918843165] [2024-10-13 13:24:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918843165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090383799] [2024-10-13 13:24:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:15,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:15,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:15,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:24:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:15,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:24:15,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:15,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:24:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090383799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:24:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-13 13:24:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150695530] [2024-10-13 13:24:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:15,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:24:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:24:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:24:15,830 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:15,881 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-10-13 13:24:15,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:24:15,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:24:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:15,882 INFO L225 Difference]: With dead ends: 57 [2024-10-13 13:24:15,883 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 13:24:15,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:24:15,884 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:15,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:24:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 13:24:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-13 13:24:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:24:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-13 13:24:15,896 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 10 [2024-10-13 13:24:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:15,896 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-13 13:24:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-13 13:24:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:24:15,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:15,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:15,913 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-10-13 13:24:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:16,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -254056039, now seen corresponding path program 1 times [2024-10-13 13:24:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917625708] [2024-10-13 13:24:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:16,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:16,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917625708] [2024-10-13 13:24:16,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917625708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:16,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:24:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:24:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665589835] [2024-10-13 13:24:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:16,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:24:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:24:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:24:16,249 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:16,326 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-13 13:24:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:24:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:24:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:16,329 INFO L225 Difference]: With dead ends: 57 [2024-10-13 13:24:16,329 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 13:24:16,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:24:16,331 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:16,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:24:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 13:24:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-13 13:24:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:24:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-10-13 13:24:16,348 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 11 [2024-10-13 13:24:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:16,348 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-10-13 13:24:16,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-10-13 13:24:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:24:16,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:16,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:16,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:24:16,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:16,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -254017310, now seen corresponding path program 1 times [2024-10-13 13:24:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:16,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404028232] [2024-10-13 13:24:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404028232] [2024-10-13 13:24:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404028232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:16,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236377523] [2024-10-13 13:24:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:16,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:16,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:16,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:16,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:24:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:16,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:24:16,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:16,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:24:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236377523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:24:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-13 13:24:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461979398] [2024-10-13 13:24:16,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:16,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:24:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:24:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:24:16,541 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:16,584 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-13 13:24:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:24:16,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:24:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:16,585 INFO L225 Difference]: With dead ends: 56 [2024-10-13 13:24:16,585 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 13:24:16,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:24:16,586 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:16,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:24:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 13:24:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-13 13:24:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:24:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-13 13:24:16,595 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2024-10-13 13:24:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:16,595 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-13 13:24:16,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-13 13:24:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:24:16,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:16,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:16,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:24:16,796 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,SelfDestructingSolverStorable5 [2024-10-13 13:24:16,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:16,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash 302744435, now seen corresponding path program 1 times [2024-10-13 13:24:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676812537] [2024-10-13 13:24:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676812537] [2024-10-13 13:24:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676812537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814331042] [2024-10-13 13:24:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:16,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:16,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:24:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:16,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:24:16,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:16,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:24:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814331042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:24:17,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:24:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-13 13:24:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124200571] [2024-10-13 13:24:17,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:24:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:24:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:24:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:24:17,031 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:17,150 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-10-13 13:24:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:24:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 13:24:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:17,151 INFO L225 Difference]: With dead ends: 92 [2024-10-13 13:24:17,151 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 13:24:17,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:24:17,152 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:17,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:24:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 13:24:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-13 13:24:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 13:24:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-10-13 13:24:17,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 14 [2024-10-13 13:24:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:17,170 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-10-13 13:24:17,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-10-13 13:24:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 13:24:17,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:17,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:17,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 13:24:17,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:17,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 795193831, now seen corresponding path program 1 times [2024-10-13 13:24:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714963344] [2024-10-13 13:24:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714963344] [2024-10-13 13:24:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714963344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470211240] [2024-10-13 13:24:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:17,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:17,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:24:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:17,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:24:17,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:17,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:24:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470211240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:24:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:24:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-13 13:24:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385738130] [2024-10-13 13:24:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:24:17,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:24:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:24:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:24:17,599 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:17,691 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-13 13:24:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:24:17,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 13:24:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:17,693 INFO L225 Difference]: With dead ends: 64 [2024-10-13 13:24:17,693 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 13:24:17,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:24:17,694 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:17,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:24:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 13:24:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-13 13:24:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 13:24:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-13 13:24:17,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 15 [2024-10-13 13:24:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-13 13:24:17,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-13 13:24:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 13:24:17,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:17,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:24:17,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:24:17,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:17,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1118794946, now seen corresponding path program 1 times [2024-10-13 13:24:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316286415] [2024-10-13 13:24:17,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:18,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316286415] [2024-10-13 13:24:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316286415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207950068] [2024-10-13 13:24:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:18,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:18,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:18,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:18,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:24:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:18,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:24:18,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:18,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:24:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:24:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207950068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:24:18,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:24:18,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-10-13 13:24:18,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862693662] [2024-10-13 13:24:18,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:24:18,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 13:24:18,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:18,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 13:24:18,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:24:18,214 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:19,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:24:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:19,986 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-10-13 13:24:19,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 13:24:19,987 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 13:24:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:19,988 INFO L225 Difference]: With dead ends: 86 [2024-10-13 13:24:19,988 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 13:24:19,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-13 13:24:19,990 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:19,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 13:24:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 13:24:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-10-13 13:24:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 13:24:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-13 13:24:20,004 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 16 [2024-10-13 13:24:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:20,004 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-13 13:24:20,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:24:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-13 13:24:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 13:24:20,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:20,010 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 13:24:20,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 13:24:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:20,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:20,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1351280755, now seen corresponding path program 1 times [2024-10-13 13:24:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:20,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395732415] [2024-10-13 13:24:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 13:24:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:24:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:24:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:24:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:24:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:24:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 13:24:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:24:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 13:24:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:24:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 13:24:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 13:24:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 13:24:20,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395732415] [2024-10-13 13:24:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395732415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441528770] [2024-10-13 13:24:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:20,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:20,688 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:20,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:24:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:20,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 13:24:20,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 13:24:21,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:24:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 13:24:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441528770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:24:21,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:24:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2024-10-13 13:24:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877880515] [2024-10-13 13:24:21,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:24:21,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-13 13:24:21,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 13:24:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 13:24:21,459 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-13 13:24:25,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:24:29,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:24:33,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:24:38,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:24:40,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:24:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:24:41,630 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2024-10-13 13:24:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-13 13:24:41,630 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 93 [2024-10-13 13:24:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:24:41,634 INFO L225 Difference]: With dead ends: 236 [2024-10-13 13:24:41,634 INFO L226 Difference]: Without dead ends: 235 [2024-10-13 13:24:41,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1016, Invalid=3144, Unknown=0, NotChecked=0, Total=4160 [2024-10-13 13:24:41,638 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 264 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 60 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:24:41,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 299 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 352 Invalid, 4 Unknown, 0 Unchecked, 19.4s Time] [2024-10-13 13:24:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-13 13:24:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2024-10-13 13:24:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.135135135135135) internal successors, (126), 111 states have internal predecessors, (126), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 13:24:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 234 transitions. [2024-10-13 13:24:41,677 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 234 transitions. Word has length 93 [2024-10-13 13:24:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:24:41,677 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 234 transitions. [2024-10-13 13:24:41,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-13 13:24:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 234 transitions. [2024-10-13 13:24:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-13 13:24:41,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:24:41,684 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-13 13:24:41,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 13:24:41,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:41,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:24:41,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:24:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 958093722, now seen corresponding path program 2 times [2024-10-13 13:24:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:24:41,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183952362] [2024-10-13 13:24:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:24:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:24:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:24:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:24:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:24:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:24:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:24:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 13:24:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:24:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 13:24:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:24:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 13:24:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 13:24:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 13:24:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 13:24:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 13:24:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 13:24:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 13:24:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 13:24:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 13:24:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 13:24:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 13:24:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 13:24:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 13:24:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-13 13:24:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 13:24:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 13:24:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 13:24:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 13:24:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 13:24:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 13:24:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 13:24:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 13:24:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 13:24:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-13 13:24:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-13 13:24:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-13 13:24:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-13 13:24:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:24:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 13:24:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:24:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183952362] [2024-10-13 13:24:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183952362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:24:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917459146] [2024-10-13 13:24:43,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:24:43,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:24:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:24:43,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:24:43,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 13:24:43,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:24:43,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:24:43,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 13:24:43,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:24:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 2388 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-13 13:24:44,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:24:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 13:24:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917459146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:24:45,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:24:45,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2024-10-13 13:24:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741733294] [2024-10-13 13:24:45,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:24:45,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-13 13:24:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:24:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-13 13:24:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 13:24:45,375 INFO L87 Difference]: Start difference. First operand 175 states and 234 transitions. Second operand has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-13 13:24:50,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:24:54,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:24:58,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:25:02,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:25:06,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:25:11,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:25:12,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:25:17,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 13:25:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:17,954 INFO L93 Difference]: Finished difference Result 592 states and 805 transitions. [2024-10-13 13:25:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-13 13:25:17,955 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) Word has length 242 [2024-10-13 13:25:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:17,962 INFO L225 Difference]: With dead ends: 592 [2024-10-13 13:25:17,962 INFO L226 Difference]: Without dead ends: 591 [2024-10-13 13:25:17,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2197, Invalid=7309, Unknown=0, NotChecked=0, Total=9506 [2024-10-13 13:25:17,969 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 440 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 84 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:17,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 287 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 31.3s Time] [2024-10-13 13:25:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-13 13:25:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 276. [2024-10-13 13:25:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 13:25:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 374 transitions. [2024-10-13 13:25:18,008 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 374 transitions. Word has length 242 [2024-10-13 13:25:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:18,010 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 374 transitions. [2024-10-13 13:25:18,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-13 13:25:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 374 transitions. [2024-10-13 13:25:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-13 13:25:18,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:18,018 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-13 13:25:18,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:25:18,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:18,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1972813965, now seen corresponding path program 1 times [2024-10-13 13:25:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458986479] [2024-10-13 13:25:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:25:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:25:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 13:25:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 13:25:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 13:25:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:25:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 13:25:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:25:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:25:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 13:25:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 13:25:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 13:25:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 13:25:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 13:25:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 13:25:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-13 13:25:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 13:25:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 13:25:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 13:25:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 13:25:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 13:25:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 13:25:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 13:25:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 13:25:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 13:25:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 13:25:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-13 13:25:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-13 13:25:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-13 13:25:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-13 13:25:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-13 13:25:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-13 13:25:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 13:25:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 13:25:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 13:25:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-13 13:25:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-13 13:25:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458986479] [2024-10-13 13:25:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458986479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515963455] [2024-10-13 13:25:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:19,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 13:25:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:19,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 13:25:19,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-13 13:25:19,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-13 13:25:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515963455] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:20,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:20,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 25 [2024-10-13 13:25:20,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618677025] [2024-10-13 13:25:20,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:20,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 13:25:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 13:25:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-10-13 13:25:20,386 INFO L87 Difference]: Start difference. First operand 276 states and 374 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 13:25:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:20,999 INFO L93 Difference]: Finished difference Result 425 states and 568 transitions. [2024-10-13 13:25:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 13:25:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 266 [2024-10-13 13:25:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:21,002 INFO L225 Difference]: With dead ends: 425 [2024-10-13 13:25:21,002 INFO L226 Difference]: Without dead ends: 309 [2024-10-13 13:25:21,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 583 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=576, Invalid=1230, Unknown=0, NotChecked=0, Total=1806 [2024-10-13 13:25:21,004 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 173 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:21,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 157 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:25:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-13 13:25:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2024-10-13 13:25:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 186 states have (on average 1.1397849462365592) internal successors, (212), 186 states have internal predecessors, (212), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 13:25:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 380 transitions. [2024-10-13 13:25:21,042 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 380 transitions. Word has length 266 [2024-10-13 13:25:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 380 transitions. [2024-10-13 13:25:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 13:25:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-10-13 13:25:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-13 13:25:21,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:21,046 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-13 13:25:21,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 13:25:21,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 13:25:21,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:21,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash 279119509, now seen corresponding path program 3 times [2024-10-13 13:25:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:21,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719293479] [2024-10-13 13:25:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 13:25:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 13:25:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 13:25:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 13:25:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 13:25:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 13:25:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 13:25:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 13:25:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 13:25:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 13:25:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 13:25:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 13:25:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 13:25:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 13:25:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 13:25:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:25:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 13:25:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 13:25:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 13:25:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 13:25:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 13:25:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 13:25:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 13:25:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 13:25:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 13:25:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 13:25:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 13:25:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-13 13:25:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-13 13:25:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-13 13:25:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-13 13:25:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-13 13:25:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-13 13:25:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-13 13:25:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-13 13:25:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-13 13:25:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 102 proven. 12 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-10-13 13:25:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719293479] [2024-10-13 13:25:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719293479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605094414] [2024-10-13 13:25:21,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:25:21,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:21,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:21,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 13:25:21,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 13:25:21,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:25:21,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:25:21,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2024-10-13 13:25:21,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605094414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-13 13:25:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242839502] [2024-10-13 13:25:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:25:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:25:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:25:21,825 INFO L87 Difference]: Start difference. First operand 285 states and 380 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 13:25:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:21,954 INFO L93 Difference]: Finished difference Result 293 states and 388 transitions. [2024-10-13 13:25:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:25:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 267 [2024-10-13 13:25:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:21,956 INFO L225 Difference]: With dead ends: 293 [2024-10-13 13:25:21,956 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:25:21,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:25:21,957 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:21,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:25:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:25:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:25:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:25:21,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2024-10-13 13:25:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:25:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 13:25:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:25:21,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:25:21,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 13:25:21,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 13:25:21,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 13:25:21,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 13:25:21,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 13:25:22,169 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:22,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:25:23,392 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:25:23,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:25:23 BoogieIcfgContainer [2024-10-13 13:25:23,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:25:23,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:25:23,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:25:23,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:25:23,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:14" (3/4) ... [2024-10-13 13:25:23,411 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:25:23,414 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:25:23,419 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 13:25:23,420 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 13:25:23,420 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:25:23,420 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:25:23,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:25:23,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:25:23,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:25:23,515 INFO L158 Benchmark]: Toolchain (without parser) took 69978.44ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 98.2MB in the beginning and 110.7MB in the end (delta: -12.5MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-13 13:25:23,515 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 165.7MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:25:23,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.76ms. Allocated memory is still 165.7MB. Free memory was 98.0MB in the beginning and 84.9MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 13:25:23,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 165.7MB. Free memory was 84.7MB in the beginning and 83.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:25:23,516 INFO L158 Benchmark]: Boogie Preprocessor took 62.37ms. Allocated memory is still 165.7MB. Free memory was 83.0MB in the beginning and 81.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:25:23,517 INFO L158 Benchmark]: RCFGBuilder took 518.71ms. Allocated memory is still 165.7MB. Free memory was 81.2MB in the beginning and 121.8MB in the end (delta: -40.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:25:23,517 INFO L158 Benchmark]: TraceAbstraction took 68910.41ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 121.1MB in the beginning and 116.0MB in the end (delta: 5.1MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2024-10-13 13:25:23,517 INFO L158 Benchmark]: Witness Printer took 105.81ms. Allocated memory is still 211.8MB. Free memory was 116.0MB in the beginning and 110.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:25:23,518 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 165.7MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.76ms. Allocated memory is still 165.7MB. Free memory was 98.0MB in the beginning and 84.9MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 165.7MB. Free memory was 84.7MB in the beginning and 83.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.37ms. Allocated memory is still 165.7MB. Free memory was 83.0MB in the beginning and 81.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 518.71ms. Allocated memory is still 165.7MB. Free memory was 81.2MB in the beginning and 121.8MB in the end (delta: -40.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 68910.41ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 121.1MB in the beginning and 116.0MB in the end (delta: 5.1MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 105.81ms. Allocated memory is still 211.8MB. Free memory was 116.0MB in the beginning and 110.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 67.6s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 56.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 1132 SdHoareTripleChecker+Valid, 52.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1132 mSDsluCounter, 1829 SdHoareTripleChecker+Invalid, 52.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1472 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1326 IncrementalHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 357 mSDtfsCounter, 1326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 1705 SyntacticMatches, 16 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4529 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=12, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 455 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1899 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4485 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1633 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 20015/23648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((counter <= 10) && (0 <= ((long long) counter + 2147483647))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((counter <= 2147483641) && (0 <= ((long long) counter + 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:25:23,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE