./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b0ae54926d75c04421ee4ea5930c958fb8ba0ccacc4d56435da8ae7b298172d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:40:05,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:40:05,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:40:05,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:40:05,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:40:05,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:40:05,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:40:05,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:40:05,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:40:05,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:40:05,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:40:05,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:40:05,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:40:05,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:40:05,564 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:40:05,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:40:05,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:40:05,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:40:05,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:40:05,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:40:05,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:40:05,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:40:05,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:40:05,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:40:05,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:40:05,571 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:40:05,572 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:40:05,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:40:05,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:40:05,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:40:05,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:40:05,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:40:05,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:40:05,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:40:05,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:40:05,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:40:05,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:40:05,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:40:05,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:40:05,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:40:05,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:40:05,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:40:05,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:40:05,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:40:05,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b0ae54926d75c04421ee4ea5930c958fb8ba0ccacc4d56435da8ae7b298172d [2024-10-11 20:40:05,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:40:05,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:40:05,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:40:05,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:40:05,861 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:40:05,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i [2024-10-11 20:40:07,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:40:07,487 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:40:07,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i [2024-10-11 20:40:07,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/df1dbb378/0162f787a56948bb87e9011e52eed913/FLAG3db2a4db1 [2024-10-11 20:40:07,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/df1dbb378/0162f787a56948bb87e9011e52eed913 [2024-10-11 20:40:07,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:40:07,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:40:07,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:40:07,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:40:07,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:40:07,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5765359f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07, skipping insertion in model container [2024-10-11 20:40:07,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:40:07,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:40:07,757 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:40:07,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:40:07,786 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:40:07,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07 WrapperNode [2024-10-11 20:40:07,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:40:07,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:40:07,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:40:07,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:40:07,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,819 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-10-11 20:40:07,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:40:07,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:40:07,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:40:07,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:40:07,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:40:07,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:40:07,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:40:07,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:40:07,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:40:07,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (1/1) ... [2024-10-11 20:40:07,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:40:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:07,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:40:07,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:40:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:40:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:40:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:40:07,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:40:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:40:07,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:40:07,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:40:08,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:40:08,181 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 20:40:08,181 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:40:08,210 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:40:08,211 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:40:08,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:40:08 BoogieIcfgContainer [2024-10-11 20:40:08,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:40:08,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:40:08,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:40:08,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:40:08,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:40:07" (1/3) ... [2024-10-11 20:40:08,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20730c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:40:08, skipping insertion in model container [2024-10-11 20:40:08,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:07" (2/3) ... [2024-10-11 20:40:08,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20730c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:40:08, skipping insertion in model container [2024-10-11 20:40:08,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:40:08" (3/3) ... [2024-10-11 20:40:08,223 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound50.i [2024-10-11 20:40:08,239 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:40:08,239 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:40:08,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:40:08,311 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;@4e0120a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:40:08,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:40:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:40:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:08,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:40:08,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:08,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 106896, now seen corresponding path program 1 times [2024-10-11 20:40:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:08,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109430514] [2024-10-11 20:40:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109430514] [2024-10-11 20:40:08,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109430514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:08,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:40:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498340303] [2024-10-11 20:40:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:40:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:40:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:40:08,590 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:08,672 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2024-10-11 20:40:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:40:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-11 20:40:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:08,680 INFO L225 Difference]: With dead ends: 49 [2024-10-11 20:40:08,680 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 20:40:08,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:40:08,686 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:08,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 20:40:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 20:40:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:40:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-11 20:40:08,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 3 [2024-10-11 20:40:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:08,724 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-11 20:40:08,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-11 20:40:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:40:08,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:08,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:08,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:40:08,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:08,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1930673058, now seen corresponding path program 1 times [2024-10-11 20:40:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13730618] [2024-10-11 20:40:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13730618] [2024-10-11 20:40:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13730618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:40:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660670433] [2024-10-11 20:40:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:08,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:40:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:40:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:40:08,864 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:08,963 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-11 20:40:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:40:08,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:40:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:08,965 INFO L225 Difference]: With dead ends: 44 [2024-10-11 20:40:08,965 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:40:08,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:40:08,967 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:08,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:40:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2024-10-11 20:40:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-11 20:40:08,975 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2024-10-11 20:40:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:08,976 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-11 20:40:08,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-11 20:40:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:40:08,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:08,977 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:08,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:40:08,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:08,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1930671808, now seen corresponding path program 1 times [2024-10-11 20:40:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427108506] [2024-10-11 20:40:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:09,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427108506] [2024-10-11 20:40:09,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427108506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:09,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164030623] [2024-10-11 20:40:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:09,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:09,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:09,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:40:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:09,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:40:09,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:09,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164030623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 20:40:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746523433] [2024-10-11 20:40:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:40:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:40:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:40:09,302 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:09,334 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-10-11 20:40:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:40:09,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:40:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:09,336 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:40:09,336 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 20:40:09,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:40:09,337 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:09,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 20:40:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-10-11 20:40:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-11 20:40:09,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 8 [2024-10-11 20:40:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:09,347 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-11 20:40:09,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-10-11 20:40:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:40:09,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:09,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:09,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:40:09,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:09,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 278677408, now seen corresponding path program 1 times [2024-10-11 20:40:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520319183] [2024-10-11 20:40:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520319183] [2024-10-11 20:40:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520319183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:09,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:40:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463931205] [2024-10-11 20:40:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:09,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:40:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:40:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:40:09,649 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:09,725 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-11 20:40:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:40:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:40:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:09,729 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:40:09,729 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 20:40:09,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:40:09,730 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:09,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 20:40:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-10-11 20:40:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 20:40:09,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 9 [2024-10-11 20:40:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:09,739 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 20:40:09,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 20:40:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:40:09,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:09,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:40:09,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:40:09,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash 278716137, now seen corresponding path program 1 times [2024-10-11 20:40:09,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103981049] [2024-10-11 20:40:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103981049] [2024-10-11 20:40:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103981049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969687850] [2024-10-11 20:40:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:09,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:09,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:09,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:40:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:09,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:40:09,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:09,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969687850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 20:40:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028330572] [2024-10-11 20:40:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:09,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:40:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:40:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:40:09,911 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:09,970 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-11 20:40:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:40:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:40:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:09,972 INFO L225 Difference]: With dead ends: 44 [2024-10-11 20:40:09,972 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:40:09,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:40:09,974 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:09,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:40:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2024-10-11 20:40:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-11 20:40:09,989 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 9 [2024-10-11 20:40:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:09,989 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-11 20:40:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-11 20:40:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:40:09,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:09,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:10,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:40:10,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:10,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1060698341, now seen corresponding path program 1 times [2024-10-11 20:40:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:10,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206978453] [2024-10-11 20:40:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:10,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206978453] [2024-10-11 20:40:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206978453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660555675] [2024-10-11 20:40:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:10,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:10,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:10,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:10,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:40:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:10,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:40:10,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:10,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660555675] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:10,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-11 20:40:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716837673] [2024-10-11 20:40:10,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:40:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:40:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:40:10,430 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:10,541 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2024-10-11 20:40:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:40:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 20:40:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:10,543 INFO L225 Difference]: With dead ends: 75 [2024-10-11 20:40:10,543 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:40:10,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:40:10,545 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:10,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 75 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:40:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2024-10-11 20:40:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-10-11 20:40:10,560 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 12 [2024-10-11 20:40:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:10,560 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-10-11 20:40:10,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-10-11 20:40:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:40:10,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:10,561 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:40:10,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:10,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038866, now seen corresponding path program 1 times [2024-10-11 20:40:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245094886] [2024-10-11 20:40:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245094886] [2024-10-11 20:40:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245094886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463632150] [2024-10-11 20:40:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:10,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:10,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:10,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:40:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:10,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:40:10,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:11,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463632150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:11,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:11,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-11 20:40:11,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367267125] [2024-10-11 20:40:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:11,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:40:11,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:11,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:40:11,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:40:11,002 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:11,052 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-10-11 20:40:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:40:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:40:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:11,054 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:40:11,054 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 20:40:11,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:40:11,055 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:11,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 20:40:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-10-11 20:40:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:40:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-10-11 20:40:11,066 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 13 [2024-10-11 20:40:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:11,067 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-10-11 20:40:11,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-10-11 20:40:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:40:11,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:11,069 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:11,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:11,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 20:40:11,270 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-10-11 20:40:11,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:11,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1425435472, now seen corresponding path program 1 times [2024-10-11 20:40:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:11,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797935417] [2024-10-11 20:40:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:11,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797935417] [2024-10-11 20:40:11,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797935417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:11,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36814602] [2024-10-11 20:40:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:11,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:11,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:11,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:11,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:40:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:11,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:40:11,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:11,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36814602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:11,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:11,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-10-11 20:40:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944680532] [2024-10-11 20:40:11,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:11,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:40:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:40:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:40:11,613 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:11,866 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-10-11 20:40:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 20:40:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:40:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:11,867 INFO L225 Difference]: With dead ends: 69 [2024-10-11 20:40:11,867 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 20:40:11,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:40:11,868 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:11,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 98 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 20:40:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-10-11 20:40:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:40:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-10-11 20:40:11,881 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 14 [2024-10-11 20:40:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:11,882 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-10-11 20:40:11,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-10-11 20:40:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:40:11,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:11,884 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:11,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:12,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:12,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:12,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1427000159, now seen corresponding path program 1 times [2024-10-11 20:40:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583065522] [2024-10-11 20:40:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 20:40:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:40:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:40:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:40:12,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583065522] [2024-10-11 20:40:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583065522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327246709] [2024-10-11 20:40:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:12,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:12,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:12,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:12,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:40:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:12,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:40:12,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:12,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:40:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327246709] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:12,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-11 20:40:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959550061] [2024-10-11 20:40:12,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 20:40:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 20:40:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:40:12,888 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 31 states, 30 states have (on average 3.0) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:40:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:13,502 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2024-10-11 20:40:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 20:40:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.0) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 42 [2024-10-11 20:40:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:13,504 INFO L225 Difference]: With dead ends: 215 [2024-10-11 20:40:13,504 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 20:40:13,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 20:40:13,509 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 147 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:13,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 200 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:40:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 20:40:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 161. [2024-10-11 20:40:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 136 states have internal predecessors, (154), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:40:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 178 transitions. [2024-10-11 20:40:13,540 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 178 transitions. Word has length 42 [2024-10-11 20:40:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:13,541 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 178 transitions. [2024-10-11 20:40:13,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.0) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:40:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2024-10-11 20:40:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 20:40:13,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:13,546 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:40:13,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:40:13,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:40:13,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1065299529, now seen corresponding path program 1 times [2024-10-11 20:40:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678179033] [2024-10-11 20:40:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:40:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:40:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:40:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678179033] [2024-10-11 20:40:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678179033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431221692] [2024-10-11 20:40:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:13,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:13,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:13,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:40:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:40:14,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:40:14,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:40:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431221692] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:14,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 25 [2024-10-11 20:40:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222642020] [2024-10-11 20:40:14,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:40:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:40:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:40:14,234 INFO L87 Difference]: Start difference. First operand 161 states and 178 transitions. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:40:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:14,560 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-10-11 20:40:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 20:40:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-10-11 20:40:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:14,563 INFO L225 Difference]: With dead ends: 241 [2024-10-11 20:40:14,563 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 20:40:14,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=576, Invalid=1230, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 20:40:14,565 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:14,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 20:40:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2024-10-11 20:40:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.144578313253012) internal successors, (190), 166 states have internal predecessors, (190), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:40:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2024-10-11 20:40:14,588 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 50 [2024-10-11 20:40:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2024-10-11 20:40:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:40:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2024-10-11 20:40:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 20:40:14,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:14,593 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:40:14,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:40:14,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:14,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1544387511, now seen corresponding path program 2 times [2024-10-11 20:40:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958389238] [2024-10-11 20:40:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:40:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:40:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:40:15,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:15,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958389238] [2024-10-11 20:40:15,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958389238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:15,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742566717] [2024-10-11 20:40:15,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:40:15,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:15,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:15,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:15,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:40:15,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:40:15,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:15,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 20:40:15,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:40:15,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:40:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742566717] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:16,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:16,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 49 [2024-10-11 20:40:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013798043] [2024-10-11 20:40:16,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:16,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 20:40:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 20:40:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1707, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 20:40:16,133 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 49 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 49 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:40:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:17,268 INFO L93 Difference]: Finished difference Result 337 states and 386 transitions. [2024-10-11 20:40:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-10-11 20:40:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 49 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-11 20:40:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:17,272 INFO L225 Difference]: With dead ends: 337 [2024-10-11 20:40:17,272 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 20:40:17,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1947 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2580, Invalid=5610, Unknown=0, NotChecked=0, Total=8190 [2024-10-11 20:40:17,276 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 405 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:17,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 150 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 20:40:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 251. [2024-10-11 20:40:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 226 states have (on average 1.1592920353982301) internal successors, (262), 226 states have internal predecessors, (262), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:40:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 286 transitions. [2024-10-11 20:40:17,291 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 286 transitions. Word has length 80 [2024-10-11 20:40:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:17,291 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 286 transitions. [2024-10-11 20:40:17,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 49 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:40:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 286 transitions. [2024-10-11 20:40:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 20:40:17,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:17,294 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:40:17,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:40:17,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:40:17,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:17,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash 593678544, now seen corresponding path program 1 times [2024-10-11 20:40:17,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378109085] [2024-10-11 20:40:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 20:40:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:40:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:40:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 20:40:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:40:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:40:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:40:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:40:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:40:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378109085] [2024-10-11 20:40:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378109085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695809814] [2024-10-11 20:40:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:18,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:18,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:18,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:18,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:40:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 20:40:18,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:18,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:40:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695809814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:19,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:19,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 66 [2024-10-11 20:40:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821588118] [2024-10-11 20:40:19,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-11 20:40:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-11 20:40:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=3410, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 20:40:19,566 INFO L87 Difference]: Start difference. First operand 251 states and 286 transitions. Second operand has 67 states, 66 states have (on average 3.1818181818181817) internal successors, (210), 67 states have internal predecessors, (210), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:40:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:21,236 INFO L93 Difference]: Finished difference Result 635 states and 722 transitions. [2024-10-11 20:40:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-11 20:40:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 3.1818181818181817) internal successors, (210), 67 states have internal predecessors, (210), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 102 [2024-10-11 20:40:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:21,240 INFO L225 Difference]: With dead ends: 635 [2024-10-11 20:40:21,240 INFO L226 Difference]: Without dead ends: 634 [2024-10-11 20:40:21,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-10-11 20:40:21,245 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 459 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:21,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 273 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:40:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-11 20:40:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 416. [2024-10-11 20:40:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 361 states have (on average 1.1412742382271468) internal successors, (412), 361 states have internal predecessors, (412), 27 states have call successors, (27), 27 states have call predecessors, (27), 27 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 20:40:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 466 transitions. [2024-10-11 20:40:21,270 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 466 transitions. Word has length 102 [2024-10-11 20:40:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:21,271 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 466 transitions. [2024-10-11 20:40:21,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.1818181818181817) internal successors, (210), 67 states have internal predecessors, (210), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 20:40:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 466 transitions. [2024-10-11 20:40:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 20:40:21,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:21,279 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 1, 1, 1] [2024-10-11 20:40:21,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:40:21,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:21,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:21,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1355164160, now seen corresponding path program 2 times [2024-10-11 20:40:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139595434] [2024-10-11 20:40:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 20:40:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 20:40:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:40:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:40:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:40:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:40:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 20:40:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:40:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:40:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 20:40:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 20:40:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:40:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:40:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 20:40:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 20:40:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 20:40:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 20:40:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:40:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 20:40:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:23,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139595434] [2024-10-11 20:40:23,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139595434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:23,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764149069] [2024-10-11 20:40:23,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:40:23,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:23,368 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:23,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:40:23,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:40:23,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:23,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 20:40:23,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:40:23,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 20:40:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764149069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:25,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 45] total 92 [2024-10-11 20:40:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912476092] [2024-10-11 20:40:25,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2024-10-11 20:40:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:25,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2024-10-11 20:40:25,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1947, Invalid=6609, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 20:40:25,464 INFO L87 Difference]: Start difference. First operand 416 states and 466 transitions. Second operand has 93 states, 92 states have (on average 3.4347826086956523) internal successors, (316), 93 states have internal predecessors, (316), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2024-10-11 20:40:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:28,085 INFO L93 Difference]: Finished difference Result 1216 states and 1356 transitions. [2024-10-11 20:40:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2024-10-11 20:40:28,085 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 3.4347826086956523) internal successors, (316), 93 states have internal predecessors, (316), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) Word has length 217 [2024-10-11 20:40:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:28,091 INFO L225 Difference]: With dead ends: 1216 [2024-10-11 20:40:28,093 INFO L226 Difference]: Without dead ends: 1215 [2024-10-11 20:40:28,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9135 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=9067, Invalid=24605, Unknown=0, NotChecked=0, Total=33672 [2024-10-11 20:40:28,100 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 867 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:28,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 388 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:40:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-10-11 20:40:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 537. [2024-10-11 20:40:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 460 states have (on average 1.1347826086956523) internal successors, (522), 460 states have internal predecessors, (522), 38 states have call successors, (38), 38 states have call predecessors, (38), 38 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 20:40:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 598 transitions. [2024-10-11 20:40:28,140 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 598 transitions. Word has length 217 [2024-10-11 20:40:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:28,141 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 598 transitions. [2024-10-11 20:40:28,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 3.4347826086956523) internal successors, (316), 93 states have internal predecessors, (316), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2024-10-11 20:40:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 598 transitions. [2024-10-11 20:40:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 20:40:28,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:28,145 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 4, 4, 3, 1, 1, 1] [2024-10-11 20:40:28,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:28,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:40:28,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:28,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1061934607, now seen corresponding path program 3 times [2024-10-11 20:40:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:28,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551322065] [2024-10-11 20:40:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:28,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 20:40:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:40:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:40:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 20:40:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:40:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:40:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 20:40:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 20:40:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:40:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:40:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:40:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 20:40:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:40:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 20:40:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 20:40:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 20:40:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 20:40:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:40:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-11 20:40:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 20:40:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551322065] [2024-10-11 20:40:30,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551322065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780999720] [2024-10-11 20:40:30,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:40:30,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:30,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:30,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:30,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:40:30,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:40:30,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:30,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:40:30,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2024-10-11 20:40:30,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780999720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [50] total 53 [2024-10-11 20:40:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688681477] [2024-10-11 20:40:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:30,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:40:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:40:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=2213, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 20:40:30,311 INFO L87 Difference]: Start difference. First operand 537 states and 598 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:30,414 INFO L93 Difference]: Finished difference Result 545 states and 606 transitions. [2024-10-11 20:40:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:40:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 233 [2024-10-11 20:40:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:30,415 INFO L225 Difference]: With dead ends: 545 [2024-10-11 20:40:30,415 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:40:30,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=659, Invalid=2421, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 20:40:30,419 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:30,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:40:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:40:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:40:30,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2024-10-11 20:40:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:30,421 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:40:30,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:40:30,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:40:30,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:40:30,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:40:30,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:40:30,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:40:30,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:40:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:40:30,629 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:30,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:40:38,076 WARN L286 SmtUtils]: Spent 7.37s on a formula simplification. DAG size of input: 400 DAG size of output: 118 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 20:40:39,277 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:40:39,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:40:39 BoogieIcfgContainer [2024-10-11 20:40:39,296 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:40:39,297 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:40:39,297 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:40:39,297 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:40:39,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:40:08" (3/4) ... [2024-10-11 20:40:39,299 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:40:39,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:40:39,306 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 20:40:39,306 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:40:39,306 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:40:39,307 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:40:39,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:40:39,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:40:39,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:40:39,401 INFO L158 Benchmark]: Toolchain (without parser) took 31882.11ms. Allocated memory was 157.3MB in the beginning and 824.2MB in the end (delta: 666.9MB). Free memory was 130.7MB in the beginning and 320.5MB in the end (delta: -189.8MB). Peak memory consumption was 476.1MB. Max. memory is 16.1GB. [2024-10-11 20:40:39,401 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:40:39,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.91ms. Allocated memory is still 157.3MB. Free memory was 130.5MB in the beginning and 119.0MB in the end (delta: 11.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-11 20:40:39,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.01ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:40:39,404 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 157.3MB. Free memory was 116.9MB in the beginning and 115.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:40:39,404 INFO L158 Benchmark]: RCFGBuilder took 362.56ms. Allocated memory is still 157.3MB. Free memory was 115.9MB in the beginning and 103.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:40:39,405 INFO L158 Benchmark]: TraceAbstraction took 31080.58ms. Allocated memory was 157.3MB in the beginning and 824.2MB in the end (delta: 666.9MB). Free memory was 102.2MB in the beginning and 324.6MB in the end (delta: -222.3MB). Peak memory consumption was 473.8MB. Max. memory is 16.1GB. [2024-10-11 20:40:39,405 INFO L158 Benchmark]: Witness Printer took 103.32ms. Allocated memory is still 824.2MB. Free memory was 324.6MB in the beginning and 320.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:40:39,406 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.02ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.91ms. Allocated memory is still 157.3MB. Free memory was 130.5MB in the beginning and 119.0MB in the end (delta: 11.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.01ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 157.3MB. Free memory was 116.9MB in the beginning and 115.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 362.56ms. Allocated memory is still 157.3MB. Free memory was 115.9MB in the beginning and 103.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31080.58ms. Allocated memory was 157.3MB in the beginning and 824.2MB in the end (delta: 666.9MB). Free memory was 102.2MB in the beginning and 324.6MB in the end (delta: -222.3MB). Peak memory consumption was 473.8MB. Max. memory is 16.1GB. * Witness Printer took 103.32ms. Allocated memory is still 824.2MB. Free memory was 324.6MB in the beginning and 320.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2181 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2181 mSDsluCounter, 1735 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1534 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1754 IncrementalHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 201 mSDtfsCounter, 1754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1860 GetRequests, 1216 SyntacticMatches, 0 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16917 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=13, InterpolantAutomatonStates: 455, 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, 14 MinimizatonAttempts, 1084 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1580 NumberOfCodeBlocks, 1372 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2065 ConstructedInterpolants, 0 QuantifiedInterpolants, 4879 SizeOfPredicates, 113 NumberOfNonLiveVariables, 1385 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 4249/11411 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: 34]: Loop Invariant Derived loop invariant: ((0 <= ((long long) counter + 2147483647)) && (counter <= 50)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((0 <= ((long long) counter + 2147483647)) && (counter <= 2147483629)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:40:39,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE