./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 082e5acb2a505af9e43ec1a894890509a127a32d8ecd4c5193a456bddcb0f4a3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:56:04,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:56:04,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:56:04,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:56:04,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:56:04,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:56:04,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:56:04,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:56:04,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:56:04,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:56:04,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:56:04,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:56:04,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:56:04,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:56:04,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:56:04,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:56:04,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:56:04,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:56:04,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:56:04,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:56:04,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:56:04,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:56:04,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:56:04,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:56:04,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:56:04,541 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:56:04,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:56:04,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:56:04,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:56:04,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:56:04,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:56:04,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:56:04,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:56:04,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:56:04,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:56:04,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:56:04,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:56:04,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:56:04,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:56:04,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:56:04,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:56:04,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:56:04,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:56:04,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:56:04,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 082e5acb2a505af9e43ec1a894890509a127a32d8ecd4c5193a456bddcb0f4a3 [2024-11-09 11:56:04,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:56:04,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:56:04,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:56:04,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:56:04,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:56:04,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c [2024-11-09 11:56:06,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:56:06,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:56:06,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c [2024-11-09 11:56:06,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85f1aaca/c7f7ecf27e1744bf98218c484420c7c8/FLAGef9beae93 [2024-11-09 11:56:06,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85f1aaca/c7f7ecf27e1744bf98218c484420c7c8 [2024-11-09 11:56:06,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:56:06,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:56:06,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:56:06,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:56:06,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:56:06,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ff41f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06, skipping insertion in model container [2024-11-09 11:56:06,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:56:07,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:56:07,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:56:07,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:56:07,059 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:56:07,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07 WrapperNode [2024-11-09 11:56:07,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:56:07,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:56:07,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:56:07,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:56:07,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,091 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-09 11:56:07,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:56:07,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:56:07,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:56:07,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:56:07,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:56:07,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:56:07,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:56:07,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:56:07,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:56:07,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (1/1) ... [2024-11-09 11:56:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:56:07,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:07,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:56:07,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:56:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:56:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:56:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:56:07,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:56:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:56:07,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:56:07,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:56:07,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:56:07,527 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 11:56:07,528 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:56:07,544 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:56:07,544 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:56:07,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:56:07 BoogieIcfgContainer [2024-11-09 11:56:07,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:56:07,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:56:07,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:56:07,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:56:07,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:56:06" (1/3) ... [2024-11-09 11:56:07,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca05ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:56:07, skipping insertion in model container [2024-11-09 11:56:07,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:07" (2/3) ... [2024-11-09 11:56:07,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca05ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:56:07, skipping insertion in model container [2024-11-09 11:56:07,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:56:07" (3/3) ... [2024-11-09 11:56:07,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound5.c [2024-11-09 11:56:07,570 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:56:07,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:56:07,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:56:07,629 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;@1533ad3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:56:07,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:56:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:56:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:56:07,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:07,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:56:07,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-09 11:56:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274240594] [2024-11-09 11:56:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:56:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274240594] [2024-11-09 11:56:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274240594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:56:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123151651] [2024-11-09 11:56:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:07,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:56:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:07,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:56:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:56:07,818 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:07,845 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-09 11:56:07,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:56:07,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 11:56:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:07,853 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:56:07,853 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 11:56:07,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:56:07,861 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:07,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 11:56:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 11:56:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 11:56:07,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2024-11-09 11:56:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:07,894 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 11:56:07,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 11:56:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:56:07,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:07,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:56:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:56:07,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-09 11:56:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735094767] [2024-11-09 11:56:07,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:56:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735094767] [2024-11-09 11:56:08,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735094767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:08,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:56:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667896006] [2024-11-09 11:56:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:56:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:56:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:56:08,006 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,072 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-09 11:56:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:56:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 11:56:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,073 INFO L225 Difference]: With dead ends: 37 [2024-11-09 11:56:08,073 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 11:56:08,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:56:08,075 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:08,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 11:56:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-09 11:56:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-09 11:56:08,089 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2024-11-09 11:56:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,090 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-09 11:56:08,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-09 11:56:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:56:08,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:08,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:56:08,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-09 11:56:08,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:08,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174027792] [2024-11-09 11:56:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:56:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174027792] [2024-11-09 11:56:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174027792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:56:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614615634] [2024-11-09 11:56:08,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:56:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:56:08,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:56:08,170 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,213 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-09 11:56:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:56:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:56:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,216 INFO L225 Difference]: With dead ends: 50 [2024-11-09 11:56:08,216 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 11:56:08,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:56:08,217 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:08,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 11:56:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 11:56:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 11:56:08,229 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2024-11-09 11:56:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,229 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 11:56:08,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 11:56:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:56:08,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:08,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:56:08,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:08,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1297109879, now seen corresponding path program 1 times [2024-11-09 11:56:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183048044] [2024-11-09 11:56:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183048044] [2024-11-09 11:56:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183048044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:08,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:56:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230899170] [2024-11-09 11:56:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:56:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:56:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:56:08,476 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,567 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-09 11:56:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:56:08,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-09 11:56:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,570 INFO L225 Difference]: With dead ends: 35 [2024-11-09 11:56:08,570 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 11:56:08,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:56:08,571 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:08,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 11:56:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 11:56:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-09 11:56:08,587 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2024-11-09 11:56:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,587 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-09 11:56:08,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-09 11:56:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:56:08,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:08,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:56:08,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:08,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1555700513, now seen corresponding path program 1 times [2024-11-09 11:56:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794224977] [2024-11-09 11:56:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794224977] [2024-11-09 11:56:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794224977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:08,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:56:08,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157876079] [2024-11-09 11:56:08,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:56:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:56:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:56:08,756 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,851 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-09 11:56:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:56:08,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 11:56:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,853 INFO L225 Difference]: With dead ends: 51 [2024-11-09 11:56:08,853 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 11:56:08,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:56:08,854 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:08,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:56:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 11:56:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-09 11:56:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:56:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-09 11:56:08,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2024-11-09 11:56:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,871 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-09 11:56:08,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-09 11:56:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:56:08,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:08,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:56:08,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1555664763, now seen corresponding path program 1 times [2024-11-09 11:56:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:08,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501711791] [2024-11-09 11:56:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501711791] [2024-11-09 11:56:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501711791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:08,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959503832] [2024-11-09 11:56:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:08,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:08,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:09,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:56:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:56:09,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:56:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959503832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:09,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:56:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 11:56:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481349769] [2024-11-09 11:56:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:56:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:09,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:56:09,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:56:09,145 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:09,202 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-09 11:56:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:56:09,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 11:56:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:09,204 INFO L225 Difference]: With dead ends: 49 [2024-11-09 11:56:09,204 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 11:56:09,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:56:09,206 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:09,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 11:56:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-09 11:56:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:56:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-09 11:56:09,214 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2024-11-09 11:56:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:09,215 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-09 11:56:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-09 11:56:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:56:09,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:09,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:09,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:56:09,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:56:09,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:09,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1040655112, now seen corresponding path program 1 times [2024-11-09 11:56:09,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:09,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573569913] [2024-11-09 11:56:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:09,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573569913] [2024-11-09 11:56:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573569913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117049813] [2024-11-09 11:56:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:09,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:09,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:09,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:09,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:56:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:56:09,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117049813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:09,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 11:56:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027982462] [2024-11-09 11:56:09,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:56:09,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:09,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:56:09,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:56:09,733 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:56:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:09,895 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-09 11:56:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:56:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2024-11-09 11:56:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:09,896 INFO L225 Difference]: With dead ends: 93 [2024-11-09 11:56:09,896 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 11:56:09,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:56:09,898 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:09,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:56:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 11:56:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2024-11-09 11:56:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:56:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-11-09 11:56:09,910 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2024-11-09 11:56:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:09,911 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-09 11:56:09,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:56:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-11-09 11:56:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:56:09,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:09,913 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:09,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:56:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 11:56:10,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:10,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 182070449, now seen corresponding path program 1 times [2024-11-09 11:56:10,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:10,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813792270] [2024-11-09 11:56:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:56:10,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813792270] [2024-11-09 11:56:10,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813792270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877554062] [2024-11-09 11:56:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:10,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:10,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:10,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:56:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:56:10,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:56:10,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:56:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877554062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:10,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:10,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-09 11:56:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106963053] [2024-11-09 11:56:10,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:56:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:56:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:56:10,572 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 11:56:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:10,946 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-09 11:56:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 11:56:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 43 [2024-11-09 11:56:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:10,948 INFO L225 Difference]: With dead ends: 133 [2024-11-09 11:56:10,948 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 11:56:10,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 11:56:10,949 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:10,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:56:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 11:56:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 11:56:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:56:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2024-11-09 11:56:10,981 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2024-11-09 11:56:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:10,981 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2024-11-09 11:56:10,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 11:56:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2024-11-09 11:56:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 11:56:10,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:10,986 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:11,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:56:11,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:11,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:11,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1955862377, now seen corresponding path program 2 times [2024-11-09 11:56:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638786565] [2024-11-09 11:56:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:56:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 11:56:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:56:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:56:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:56:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638786565] [2024-11-09 11:56:11,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638786565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923940196] [2024-11-09 11:56:11,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:56:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:11,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:11,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:56:11,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:56:11,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:56:11,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:56:11,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 11:56:11,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:56:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923940196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:12,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-09 11:56:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860606358] [2024-11-09 11:56:12,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:12,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 11:56:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 11:56:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 11:56:12,159 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-09 11:56:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:12,649 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-11-09 11:56:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 11:56:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2024-11-09 11:56:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:12,653 INFO L225 Difference]: With dead ends: 196 [2024-11-09 11:56:12,654 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:56:12,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2024-11-09 11:56:12,657 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:12,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 250 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:56:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:56:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 144. [2024-11-09 11:56:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 11:56:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2024-11-09 11:56:12,689 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2024-11-09 11:56:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:12,690 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2024-11-09 11:56:12,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-09 11:56:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2024-11-09 11:56:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 11:56:12,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:12,692 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:12,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:56:12,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:12,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1533400926, now seen corresponding path program 1 times [2024-11-09 11:56:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28919914] [2024-11-09 11:56:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:56:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:56:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 11:56:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 11:56:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:56:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:56:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 11:56:13,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28919914] [2024-11-09 11:56:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28919914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677191112] [2024-11-09 11:56:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:13,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:13,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:13,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:13,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:56:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:56:13,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 389 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:56:13,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 11:56:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677191112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:13,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 14 [2024-11-09 11:56:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006975090] [2024-11-09 11:56:13,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:56:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:56:13,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:56:13,627 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-09 11:56:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:13,841 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2024-11-09 11:56:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 11:56:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 111 [2024-11-09 11:56:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:13,843 INFO L225 Difference]: With dead ends: 238 [2024-11-09 11:56:13,843 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 11:56:13,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 238 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:56:13,844 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:13,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 314 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:56:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 11:56:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2024-11-09 11:56:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 135 states have (on average 1.0962962962962963) internal successors, (148), 135 states have internal predecessors, (148), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 11:56:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2024-11-09 11:56:13,873 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 111 [2024-11-09 11:56:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2024-11-09 11:56:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-09 11:56:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2024-11-09 11:56:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 11:56:13,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:13,875 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:13,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:56:14,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:56:14,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:14,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash 85407691, now seen corresponding path program 2 times [2024-11-09 11:56:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766088611] [2024-11-09 11:56:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 11:56:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:56:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:56:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:56:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 11:56:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 11:56:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:56:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 11:56:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 11:56:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 11:56:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-11-09 11:56:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766088611] [2024-11-09 11:56:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766088611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366441893] [2024-11-09 11:56:14,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:56:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:14,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:14,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:56:14,532 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:56:14,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:56:14,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:56:14,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 495 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-09 11:56:14,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-11-09 11:56:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366441893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:14,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:14,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 14 [2024-11-09 11:56:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965399880] [2024-11-09 11:56:14,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:56:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:56:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:56:14,851 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 6 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-09 11:56:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:15,083 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2024-11-09 11:56:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 11:56:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 6 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 123 [2024-11-09 11:56:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:15,085 INFO L225 Difference]: With dead ends: 185 [2024-11-09 11:56:15,085 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 11:56:15,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 264 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:56:15,086 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:15,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 309 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:56:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 11:56:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-09 11:56:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 11:56:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2024-11-09 11:56:15,098 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 123 [2024-11-09 11:56:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:15,099 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2024-11-09 11:56:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 6 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-09 11:56:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2024-11-09 11:56:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 11:56:15,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:15,101 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:15,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:56:15,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:15,302 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash 885517192, now seen corresponding path program 1 times [2024-11-09 11:56:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802262082] [2024-11-09 11:56:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:56:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 11:56:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:56:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:56:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 11:56:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:56:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 11:56:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 11:56:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:56:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 11:56:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 11:56:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2024-11-09 11:56:15,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802262082] [2024-11-09 11:56:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802262082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:56:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177219387] [2024-11-09 11:56:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:15,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:56:15,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:56:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:56:15,457 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:56:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:15,481 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2024-11-09 11:56:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:56:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2024-11-09 11:56:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:15,482 INFO L225 Difference]: With dead ends: 108 [2024-11-09 11:56:15,482 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:56:15,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:56:15,484 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:15,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:56:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:56:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:56:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:56:15,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2024-11-09 11:56:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:15,485 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:56:15,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:56:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:56:15,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:56:15,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:56:15,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:56:15,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:56:15,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:56:15,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 11:56:15,492 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:15,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:56:15,805 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:56:15,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:56:15 BoogieIcfgContainer [2024-11-09 11:56:15,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:56:15,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:56:15,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:56:15,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:56:15,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:56:07" (3/4) ... [2024-11-09 11:56:15,829 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:56:15,833 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:56:15,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 11:56:15,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:56:15,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:56:15,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:56:15,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:56:15,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:56:15,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:56:15,926 INFO L158 Benchmark]: Toolchain (without parser) took 9128.70ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 99.5MB in the beginning and 73.4MB in the end (delta: 26.1MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,926 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 113.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:56:15,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.27ms. Allocated memory is still 153.1MB. Free memory was 99.5MB in the beginning and 86.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.31ms. Allocated memory is still 153.1MB. Free memory was 86.9MB in the beginning and 85.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,926 INFO L158 Benchmark]: Boogie Preprocessor took 43.84ms. Allocated memory is still 153.1MB. Free memory was 85.2MB in the beginning and 83.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,927 INFO L158 Benchmark]: RCFGBuilder took 408.47ms. Allocated memory is still 153.1MB. Free memory was 83.1MB in the beginning and 119.2MB in the end (delta: -36.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,927 INFO L158 Benchmark]: TraceAbstraction took 8278.37ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 78.6MB in the end (delta: 40.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,927 INFO L158 Benchmark]: Witness Printer took 98.87ms. Allocated memory is still 186.6MB. Free memory was 78.6MB in the beginning and 73.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:56:15,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 113.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.27ms. Allocated memory is still 153.1MB. Free memory was 99.5MB in the beginning and 86.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.31ms. Allocated memory is still 153.1MB. Free memory was 86.9MB in the beginning and 85.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.84ms. Allocated memory is still 153.1MB. Free memory was 85.2MB in the beginning and 83.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.47ms. Allocated memory is still 153.1MB. Free memory was 83.1MB in the beginning and 119.2MB in the end (delta: -36.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8278.37ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 78.6MB in the end (delta: 40.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Witness Printer took 98.87ms. Allocated memory is still 186.6MB. Free memory was 78.6MB in the beginning and 73.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 1669 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1280 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 929 IncrementalHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 389 mSDtfsCounter, 929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1114 GetRequests, 915 SyntacticMatches, 22 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1443 ConstructedInterpolants, 0 QuantifiedInterpolants, 2941 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1017 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 4530/4983 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((2 <= counter) && (counter <= 5)) || (counter == 0)) || (counter == 1)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (((((5 <= counter) && (counter <= 2147483646)) || ((counter <= 6) && (3 <= counter))) || (counter == 1)) || (counter == 2)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:56:15,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE