./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:24:59,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:24:59,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:24:59,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:24:59,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:24:59,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:24:59,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:24:59,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:24:59,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:24:59,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:24:59,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:24:59,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:24:59,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:24:59,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:24:59,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:24:59,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:24:59,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:24:59,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:24:59,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:24:59,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:24:59,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:24:59,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:24:59,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:24:59,237 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:24:59,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:24:59,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:24:59,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:24:59,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:24:59,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:24:59,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:24:59,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:24:59,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:24:59,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:24:59,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:24:59,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:24:59,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:24:59,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:24:59,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:24:59,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:24:59,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:24:59,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:24:59,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2024-10-11 20:24:59,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:24:59,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:24:59,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:24:59,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:24:59,537 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:24:59,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-10-11 20:25:00,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:25:01,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:25:01,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-10-11 20:25:01,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cda3d438a/fdb059a297494d61921d316350868a3c/FLAGdbdb688e7 [2024-10-11 20:25:01,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cda3d438a/fdb059a297494d61921d316350868a3c [2024-10-11 20:25:01,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:25:01,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:25:01,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:25:01,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:25:01,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:25:01,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:01" (1/1) ... [2024-10-11 20:25:01,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de7b09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:01, skipping insertion in model container [2024-10-11 20:25:01,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:01" (1/1) ... [2024-10-11 20:25:01,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:25:01,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:25:01,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:25:01,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:25:02,015 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:25:02,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02 WrapperNode [2024-10-11 20:25:02,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:25:02,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:25:02,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:25:02,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:25:02,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,055 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-11 20:25:02,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:25:02,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:25:02,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:25:02,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:25:02,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,096 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-11 20:25:02,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:25:02,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:25:02,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:25:02,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:25:02,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (1/1) ... [2024-10-11 20:25:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:25:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:02,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:25:02,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:25:02,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:25:02,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:25:02,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:25:02,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:25:02,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:25:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:25:02,334 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:25:02,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:25:02,575 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 20:25:02,575 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:25:02,596 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:25:02,597 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:25:02,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:02 BoogieIcfgContainer [2024-10-11 20:25:02,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:25:02,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:25:02,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:25:02,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:25:02,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:25:01" (1/3) ... [2024-10-11 20:25:02,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0989d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:02, skipping insertion in model container [2024-10-11 20:25:02,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:02" (2/3) ... [2024-10-11 20:25:02,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0989d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:02, skipping insertion in model container [2024-10-11 20:25:02,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:02" (3/3) ... [2024-10-11 20:25:02,607 INFO L112 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2024-10-11 20:25:02,623 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:25:02,624 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 20:25:02,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:25:02,681 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;@6d0fd4e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:25:02,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-11 20:25:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:25:02,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:02,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:25:02,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:02,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash 109135861, now seen corresponding path program 1 times [2024-10-11 20:25:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55597688] [2024-10-11 20:25:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55597688] [2024-10-11 20:25:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55597688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:02,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992607471] [2024-10-11 20:25:02,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:02,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:02,976 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 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) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:03,041 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-10-11 20:25:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:03,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:25:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:03,049 INFO L225 Difference]: With dead ends: 77 [2024-10-11 20:25:03,049 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:25:03,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:03,055 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:03,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:25:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 20:25:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-11 20:25:03,086 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 5 [2024-10-11 20:25:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:03,088 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-11 20:25:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-10-11 20:25:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:25:03,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:03,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:25:03,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1798150634, now seen corresponding path program 1 times [2024-10-11 20:25:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043229869] [2024-10-11 20:25:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043229869] [2024-10-11 20:25:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043229869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:25:03,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636167251] [2024-10-11 20:25:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:03,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:03,227 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:03,260 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2024-10-11 20:25:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:25:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:03,262 INFO L225 Difference]: With dead ends: 71 [2024-10-11 20:25:03,263 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:25:03,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:03,265 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:03,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:25:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 20:25:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-10-11 20:25:03,276 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2024-10-11 20:25:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:03,277 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-11 20:25:03,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-10-11 20:25:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:25:03,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:03,278 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:03,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:25:03,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash -23753348, now seen corresponding path program 1 times [2024-10-11 20:25:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641650399] [2024-10-11 20:25:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641650399] [2024-10-11 20:25:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641650399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76832459] [2024-10-11 20:25:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:03,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:03,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:25:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:03,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:03,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:03,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76832459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:03,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:03,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2024-10-11 20:25:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218879680] [2024-10-11 20:25:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:03,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:03,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:03,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:03,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:03,624 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:03,685 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-11 20:25:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:03,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:25:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:03,686 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:25:03,686 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:25:03,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:03,688 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:03,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:25:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-11 20:25:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-10-11 20:25:03,701 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2024-10-11 20:25:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:03,701 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-10-11 20:25:03,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-10-11 20:25:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:25:03,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:03,704 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:03,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:03,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:03,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:03,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1751254014, now seen corresponding path program 1 times [2024-10-11 20:25:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600696862] [2024-10-11 20:25:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:03,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:03,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600696862] [2024-10-11 20:25:03,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600696862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966781409] [2024-10-11 20:25:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:04,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:25:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:04,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:04,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:04,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966781409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:04,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:04,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:25:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235984038] [2024-10-11 20:25:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:04,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:25:04,102 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:04,146 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-10-11 20:25:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:25:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:04,147 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:25:04,147 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 20:25:04,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:25:04,149 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:04,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 20:25:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 20:25:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-10-11 20:25:04,157 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 8 [2024-10-11 20:25:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:04,157 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-10-11 20:25:04,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-10-11 20:25:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:25:04,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:04,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:25:04,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:25:04,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:04,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1545700361, now seen corresponding path program 1 times [2024-10-11 20:25:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532445127] [2024-10-11 20:25:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:04,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:04,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532445127] [2024-10-11 20:25:04,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532445127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622986838] [2024-10-11 20:25:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:04,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:04,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:04,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:25:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:04,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:04,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:04,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622986838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:04,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:25:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879807476] [2024-10-11 20:25:04,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:04,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:25:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:25:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:04,611 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:04,672 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-10-11 20:25:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:25:04,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 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 9 [2024-10-11 20:25:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:04,674 INFO L225 Difference]: With dead ends: 55 [2024-10-11 20:25:04,675 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 20:25:04,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:04,676 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:04,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 20:25:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 20:25:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-10-11 20:25:04,685 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 9 [2024-10-11 20:25:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:04,685 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-10-11 20:25:04,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-10-11 20:25:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:25:04,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:04,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:04,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:25:04,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:04,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1354327631, now seen corresponding path program 1 times [2024-10-11 20:25:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142744777] [2024-10-11 20:25:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142744777] [2024-10-11 20:25:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142744777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:04,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:25:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491227221] [2024-10-11 20:25:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:25:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:25:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:25:04,942 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:04,963 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-10-11 20:25:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:25:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:25:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:04,966 INFO L225 Difference]: With dead ends: 54 [2024-10-11 20:25:04,966 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 20:25:04,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:25:04,967 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:04,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 20:25:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 20:25:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-10-11 20:25:04,973 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 10 [2024-10-11 20:25:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:04,974 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-11 20:25:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-10-11 20:25:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:25:04,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:04,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:25:04,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash 965516471, now seen corresponding path program 1 times [2024-10-11 20:25:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:04,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312534898] [2024-10-11 20:25:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312534898] [2024-10-11 20:25:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312534898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:05,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:05,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81548630] [2024-10-11 20:25:05,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:05,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:05,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:05,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,060 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:05,087 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2024-10-11 20:25:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:05,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:25:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:05,088 INFO L225 Difference]: With dead ends: 83 [2024-10-11 20:25:05,088 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 20:25:05,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,091 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:05,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 20:25:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 20:25:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.5) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-11 20:25:05,100 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 11 [2024-10-11 20:25:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:05,100 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-11 20:25:05,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-10-11 20:25:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:25:05,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:05,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:05,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:25:05,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:05,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 572489461, now seen corresponding path program 1 times [2024-10-11 20:25:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234031958] [2024-10-11 20:25:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234031958] [2024-10-11 20:25:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234031958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184420351] [2024-10-11 20:25:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:05,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:05,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:05,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:25:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:05,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:05,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184420351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-11 20:25:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294035497] [2024-10-11 20:25:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:05,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:25:05,287 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:05,321 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-10-11 20:25:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:25:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:05,322 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:25:05,322 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 20:25:05,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:25:05,323 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:05,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 20:25:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-10-11 20:25:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.56) internal successors, (78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-10-11 20:25:05,335 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 11 [2024-10-11 20:25:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:05,335 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-10-11 20:25:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-10-11 20:25:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:25:05,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:05,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:05,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:25:05,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:25:05,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:05,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:05,538 INFO L85 PathProgramCache]: Analyzing trace with hash 406560599, now seen corresponding path program 1 times [2024-10-11 20:25:05,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:05,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444735006] [2024-10-11 20:25:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:05,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444735006] [2024-10-11 20:25:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444735006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:25:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123301601] [2024-10-11 20:25:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:05,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:25:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:25:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:25:05,584 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:05,628 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2024-10-11 20:25:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:25:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-10-11 20:25:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:05,629 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:25:05,629 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 20:25:05,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:25:05,630 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:05,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 20:25:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-10-11 20:25:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 81 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2024-10-11 20:25:05,637 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 13 [2024-10-11 20:25:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2024-10-11 20:25:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2024-10-11 20:25:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:25:05,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:05,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:25:05,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -281524360, now seen corresponding path program 1 times [2024-10-11 20:25:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473305226] [2024-10-11 20:25:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473305226] [2024-10-11 20:25:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473305226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090789933] [2024-10-11 20:25:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:05,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,692 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:05,721 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-10-11 20:25:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:25:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:05,722 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:25:05,722 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 20:25:05,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,723 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:05,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 20:25:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 20:25:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.457142857142857) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2024-10-11 20:25:05,736 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 14 [2024-10-11 20:25:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:05,736 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2024-10-11 20:25:05,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2024-10-11 20:25:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:25:05,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:05,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:05,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:25:05,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:05,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:05,738 INFO L85 PathProgramCache]: Analyzing trace with hash -137320460, now seen corresponding path program 1 times [2024-10-11 20:25:05,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:05,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189905876] [2024-10-11 20:25:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189905876] [2024-10-11 20:25:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189905876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719629206] [2024-10-11 20:25:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:05,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,779 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:05,811 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-10-11 20:25:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:25:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:05,812 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:25:05,812 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:25:05,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,813 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:05,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:25:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2024-10-11 20:25:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 83 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-11 20:25:05,819 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 15 [2024-10-11 20:25:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:05,819 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-11 20:25:05,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-11 20:25:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:25:05,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:05,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:25:05,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:05,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1212439238, now seen corresponding path program 1 times [2024-10-11 20:25:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635265389] [2024-10-11 20:25:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:05,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:05,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635265389] [2024-10-11 20:25:05,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635265389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:05,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:05,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389623831] [2024-10-11 20:25:05,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:05,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,857 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:05,920 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2024-10-11 20:25:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:05,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-11 20:25:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:05,921 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:25:05,922 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 20:25:05,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:05,923 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:05,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 20:25:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-11 20:25:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 89 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2024-10-11 20:25:05,928 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 17 [2024-10-11 20:25:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:05,928 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2024-10-11 20:25:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2024-10-11 20:25:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:25:05,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:05,929 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2024-10-11 20:25:05,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:25:05,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash 828839330, now seen corresponding path program 2 times [2024-10-11 20:25:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133372614] [2024-10-11 20:25:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133372614] [2024-10-11 20:25:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133372614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493603032] [2024-10-11 20:25:06,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:25:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:06,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:06,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:25:06,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:25:06,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:25:06,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:25:06,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:25:06,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:25:06,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493603032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:06,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:06,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 13 [2024-10-11 20:25:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267080088] [2024-10-11 20:25:06,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:06,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:25:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:25:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:25:06,236 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:06,398 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-10-11 20:25:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:25:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 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 18 [2024-10-11 20:25:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:06,400 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:25:06,400 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:25:06,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:25:06,401 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:06,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:25:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2024-10-11 20:25:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.411764705882353) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-10-11 20:25:06,405 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 18 [2024-10-11 20:25:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:06,405 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-10-11 20:25:06,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-10-11 20:25:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:25:06,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:06,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:06,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:06,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:25:06,610 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:06,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2104893361, now seen corresponding path program 1 times [2024-10-11 20:25:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189338869] [2024-10-11 20:25:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189338869] [2024-10-11 20:25:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189338869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626981672] [2024-10-11 20:25:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:06,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:25:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:25:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:25:06,649 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:06,695 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2024-10-11 20:25:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:25:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-11 20:25:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:06,696 INFO L225 Difference]: With dead ends: 121 [2024-10-11 20:25:06,697 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:25:06,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:25:06,697 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:06,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:25:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 20:25:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 77 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2024-10-11 20:25:06,703 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 18 [2024-10-11 20:25:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:06,703 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2024-10-11 20:25:06,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2024-10-11 20:25:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:25:06,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:06,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:06,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:25:06,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash 770017602, now seen corresponding path program 1 times [2024-10-11 20:25:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:06,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620853574] [2024-10-11 20:25:06,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620853574] [2024-10-11 20:25:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620853574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543405163] [2024-10-11 20:25:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:06,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:06,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:25:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:06,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:25:06,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:25:06,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:25:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543405163] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:06,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 11 [2024-10-11 20:25:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814782345] [2024-10-11 20:25:06,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:06,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:25:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:06,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:25:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:25:06,924 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:07,088 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2024-10-11 20:25:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:25:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 22 [2024-10-11 20:25:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:07,089 INFO L225 Difference]: With dead ends: 176 [2024-10-11 20:25:07,089 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 20:25:07,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:25:07,090 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:07,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:25:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 20:25:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2024-10-11 20:25:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 98 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2024-10-11 20:25:07,100 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 22 [2024-10-11 20:25:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:07,100 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2024-10-11 20:25:07,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2024-10-11 20:25:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:25:07,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:07,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:07,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:25:07,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:25:07,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2040048166, now seen corresponding path program 1 times [2024-10-11 20:25:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859072727] [2024-10-11 20:25:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:25:07,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:07,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859072727] [2024-10-11 20:25:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859072727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:07,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907788407] [2024-10-11 20:25:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:07,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:07,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:07,383 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:07,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:25:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:07,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:25:07,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:25:07,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:25:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907788407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:07,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:25:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264567099] [2024-10-11 20:25:07,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:25:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:25:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:07,514 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:07,598 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-10-11 20:25:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:25:07,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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 26 [2024-10-11 20:25:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:07,600 INFO L225 Difference]: With dead ends: 122 [2024-10-11 20:25:07,600 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:25:07,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:07,601 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:07,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:25:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-11 20:25:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-10-11 20:25:07,606 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 26 [2024-10-11 20:25:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-11 20:25:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2024-10-11 20:25:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:25:07,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:07,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:07,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:25:07,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:07,808 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:07,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1287581498, now seen corresponding path program 1 times [2024-10-11 20:25:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360266505] [2024-10-11 20:25:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:25:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360266505] [2024-10-11 20:25:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360266505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736891965] [2024-10-11 20:25:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:07,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:07,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:07,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:07,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:07,869 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:07,909 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2024-10-11 20:25:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 29 [2024-10-11 20:25:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:07,910 INFO L225 Difference]: With dead ends: 115 [2024-10-11 20:25:07,910 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:25:07,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:07,911 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:07,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:25:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 20:25:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.205607476635514) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-10-11 20:25:07,919 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 29 [2024-10-11 20:25:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:07,919 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-10-11 20:25:07,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-10-11 20:25:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:25:07,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:07,921 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:07,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:25:07,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:07,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1998842447, now seen corresponding path program 1 times [2024-10-11 20:25:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964994310] [2024-10-11 20:25:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:25:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964994310] [2024-10-11 20:25:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964994310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266515002] [2024-10-11 20:25:08,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:08,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:08,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:08,097 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:08,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:25:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:08,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:25:08,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:25:08,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266515002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 14 [2024-10-11 20:25:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965445977] [2024-10-11 20:25:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:08,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:25:08,300 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:08,344 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-10-11 20:25:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:08,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 30 [2024-10-11 20:25:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:08,345 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:25:08,345 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:25:08,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:25:08,346 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:08,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:25:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-10-11 20:25:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2024-10-11 20:25:08,353 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 30 [2024-10-11 20:25:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:08,353 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2024-10-11 20:25:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2024-10-11 20:25:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:25:08,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:08,354 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:08,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:25:08,556 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:08,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1836762451, now seen corresponding path program 1 times [2024-10-11 20:25:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183717525] [2024-10-11 20:25:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:25:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:08,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183717525] [2024-10-11 20:25:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183717525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212127288] [2024-10-11 20:25:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:08,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:08,612 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:08,646 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2024-10-11 20:25:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 39 [2024-10-11 20:25:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:08,648 INFO L225 Difference]: With dead ends: 110 [2024-10-11 20:25:08,648 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 20:25:08,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:08,649 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:08,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 20:25:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 20:25:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 108 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2024-10-11 20:25:08,654 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 39 [2024-10-11 20:25:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:08,655 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2024-10-11 20:25:08,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2024-10-11 20:25:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:25:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:08,656 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:08,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:25:08,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:08,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1466046981, now seen corresponding path program 1 times [2024-10-11 20:25:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383741512] [2024-10-11 20:25:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:25:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383741512] [2024-10-11 20:25:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383741512] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925240812] [2024-10-11 20:25:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:08,824 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:08,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:25:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:08,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:25:08,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:25:09,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:25:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925240812] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:09,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:09,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2024-10-11 20:25:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299166774] [2024-10-11 20:25:09,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:09,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:25:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:25:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:25:09,119 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:09,208 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2024-10-11 20:25:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:25:09,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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 43 [2024-10-11 20:25:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:09,209 INFO L225 Difference]: With dead ends: 213 [2024-10-11 20:25:09,209 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 20:25:09,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:25:09,210 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:09,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 20:25:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-10-11 20:25:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.1346153846153846) internal successors, (177), 157 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2024-10-11 20:25:09,217 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 43 [2024-10-11 20:25:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:09,217 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2024-10-11 20:25:09,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2024-10-11 20:25:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:25:09,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:09,219 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:09,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:25:09,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:09,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:09,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1424561798, now seen corresponding path program 2 times [2024-10-11 20:25:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439920497] [2024-10-11 20:25:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:25:09,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:09,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439920497] [2024-10-11 20:25:09,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439920497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:09,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717125908] [2024-10-11 20:25:09,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:25:09,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:09,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:09,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:09,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:25:09,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:25:09,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:25:09,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:25:09,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 20:25:09,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717125908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-11 20:25:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981473426] [2024-10-11 20:25:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:09,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:09,656 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:09,693 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2024-10-11 20:25:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:25:09,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 44 [2024-10-11 20:25:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:09,694 INFO L225 Difference]: With dead ends: 158 [2024-10-11 20:25:09,694 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:25:09,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:25:09,695 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:09,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:25:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 55. [2024-10-11 20:25:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-10-11 20:25:09,698 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 44 [2024-10-11 20:25:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-10-11 20:25:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-10-11 20:25:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:25:09,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:09,699 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:09,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:09,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 20:25:09,900 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:25:09,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash 152313104, now seen corresponding path program 2 times [2024-10-11 20:25:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:09,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987656759] [2024-10-11 20:25:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:25:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987656759] [2024-10-11 20:25:10,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987656759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056839858] [2024-10-11 20:25:10,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:25:10,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:10,078 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:10,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:25:10,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:25:10,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:25:10,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:25:10,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:25:10,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:25:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056839858] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:10,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:10,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-10-11 20:25:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615612756] [2024-10-11 20:25:10,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:10,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:25:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:25:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:25:10,324 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:10,692 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-10-11 20:25:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 20:25:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 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 46 [2024-10-11 20:25:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:10,695 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:25:10,695 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:25:10,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:25:10,696 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:10,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 14 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:25:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:25:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:25:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:25:10,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-10-11 20:25:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:10,697 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:25:10,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:25:10,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:25:10,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2024-10-11 20:25:10,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2024-10-11 20:25:10,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2024-10-11 20:25:10,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2024-10-11 20:25:10,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2024-10-11 20:25:10,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2024-10-11 20:25:10,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2024-10-11 20:25:10,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2024-10-11 20:25:10,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2024-10-11 20:25:10,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2024-10-11 20:25:10,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2024-10-11 20:25:10,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2024-10-11 20:25:10,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2024-10-11 20:25:10,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2024-10-11 20:25:10,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:25:10,911 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:10,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:25:11,160 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:25:11,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:25:11 BoogieIcfgContainer [2024-10-11 20:25:11,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:25:11,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:25:11,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:25:11,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:25:11,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:02" (3/4) ... [2024-10-11 20:25:11,186 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:25:11,193 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 20:25:11,194 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:25:11,194 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:25:11,194 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:25:11,289 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:25:11,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:25:11,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:25:11,290 INFO L158 Benchmark]: Toolchain (without parser) took 9730.70ms. Allocated memory was 138.4MB in the beginning and 224.4MB in the end (delta: 86.0MB). Free memory was 80.1MB in the beginning and 181.6MB in the end (delta: -101.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:25:11,291 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:25:11,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.70ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 61.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:25:11,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.00ms. Allocated memory is still 138.4MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:11,291 INFO L158 Benchmark]: Boogie Preprocessor took 64.54ms. Allocated memory is still 138.4MB. Free memory was 59.9MB in the beginning and 57.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:11,292 INFO L158 Benchmark]: RCFGBuilder took 475.17ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 57.9MB in the beginning and 145.0MB in the end (delta: -87.1MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-10-11 20:25:11,293 INFO L158 Benchmark]: TraceAbstraction took 8583.51ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 145.0MB in the beginning and 186.8MB in the end (delta: -41.8MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:11,293 INFO L158 Benchmark]: Witness Printer took 106.70ms. Allocated memory is still 224.4MB. Free memory was 186.8MB in the beginning and 181.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:25:11,294 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.70ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 61.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.00ms. Allocated memory is still 138.4MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.54ms. Allocated memory is still 138.4MB. Free memory was 59.9MB in the beginning and 57.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.17ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 57.9MB in the beginning and 145.0MB in the end (delta: -87.1MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8583.51ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 145.0MB in the beginning and 186.8MB in the end (delta: -41.8MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. * Witness Printer took 106.70ms. Allocated memory is still 224.4MB. Free memory was 186.8MB in the beginning and 181.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: 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 1 procedures, 40 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 1917 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1358 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1572 IncrementalHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 559 mSDtfsCounter, 1572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 381 SyntacticMatches, 16 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=20, InterpolantAutomatonStates: 139, 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, 22 MinimizatonAttempts, 104 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 708 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 2300 SizeOfPredicates, 12 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 39 InterpolantComputations, 16 PerfectInterpolantSequences, 380/548 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 14 specifications checked. All of them hold - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: ((((((0 <= (i + 2147483649)) && (2 <= pass)) && (((long) pass + 1) <= n)) && (n <= 2147483647)) || (((0 <= (i + 2147483649)) && (n == 2)) && (pass == 1))) || ((((((long) 2 + pass) <= n) && (0 <= (i + 2147483649))) && (n <= 2147483647)) && (pass == 1))) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((n <= 2147483647) && (pass == 1)) || ((2 <= pass) && (n <= 2147483647))) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: ((((((array_size <= 2147483647) && (i == 0)) && (1 <= array_size)) || (((array_size <= 2147483647) && (i == 1)) && (1 <= array_size))) || (((array_size <= 2147483647) && (2 <= i)) && (3 <= array_size))) || (((array_size <= 2147483647) && (2 == i)) && (1 <= array_size))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:25:11,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE