./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/divbin_unwindbound5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:25:20,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:25:20,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:25:20,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:25:20,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:25:20,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:25:20,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:25:20,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:25:20,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:25:20,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:25:20,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:25:20,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:25:20,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:25:20,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:25:20,598 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:25:20,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:25:20,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:25:20,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:25:20,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:25:20,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:25:20,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:25:20,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:25:20,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:25:20,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:25:20,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:25:20,605 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:25:20,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:25:20,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:25:20,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:25:20,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:25:20,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:25:20,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:25:20,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:25:20,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:25:20,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:25:20,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:25:20,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:25:20,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:25:20,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:25:20,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:25:20,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:25:20,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:25:20,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:25:20,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:25:20,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 [2024-10-13 13:25:20,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:25:20,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:25:20,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:25:20,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:25:20,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:25:20,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-10-13 13:25:22,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:25:22,559 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:25:22,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-10-13 13:25:22,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5a657a3/376a275ea3114599ac73d43067fe6a9c/FLAGd2c49f93b [2024-10-13 13:25:22,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5a657a3/376a275ea3114599ac73d43067fe6a9c [2024-10-13 13:25:22,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:25:22,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:25:22,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:25:22,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:25:22,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:25:22,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8bb3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22, skipping insertion in model container [2024-10-13 13:25:22,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:25:22,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:25:22,827 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:25:22,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:25:22,861 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:25:22,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22 WrapperNode [2024-10-13 13:25:22,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:25:22,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:25:22,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:25:22,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:25:22,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,896 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-10-13 13:25:22,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:25:22,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:25:22,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:25:22,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:25:22,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,922 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:25:22,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:25:22,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:25:22,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:25:22,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:25:22,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:25:22,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:22,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:25:22,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:25:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:25:23,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 13:25:23,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 13:25:23,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:25:23,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:25:23,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:25:23,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:25:23,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:25:23,110 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:25:23,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:25:23,265 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 13:25:23,265 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:25:23,290 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:25:23,290 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:25:23,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:25:23 BoogieIcfgContainer [2024-10-13 13:25:23,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:25:23,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:25:23,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:25:23,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:25:23,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:25:22" (1/3) ... [2024-10-13 13:25:23,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101321ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:25:23, skipping insertion in model container [2024-10-13 13:25:23,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (2/3) ... [2024-10-13 13:25:23,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101321ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:25:23, skipping insertion in model container [2024-10-13 13:25:23,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:25:23" (3/3) ... [2024-10-13 13:25:23,299 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2024-10-13 13:25:23,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:25:23,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 13:25:23,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:25:23,370 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;@5ed7c88e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:25:23,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 13:25:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:25:23,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:23,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:23,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:23,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1641202500, now seen corresponding path program 1 times [2024-10-13 13:25:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:23,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517542669] [2024-10-13 13:25:23,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517542669] [2024-10-13 13:25:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517542669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:23,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:23,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:25:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737987851] [2024-10-13 13:25:23,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:23,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:25:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:25:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:25:23,610 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:25:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:23,639 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2024-10-13 13:25:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:25:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-13 13:25:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:23,649 INFO L225 Difference]: With dead ends: 63 [2024-10-13 13:25:23,649 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:25:23,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:25:23,655 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:23,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:25:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 13:25:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:25:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-13 13:25:23,692 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2024-10-13 13:25:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:23,693 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-13 13:25:23,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:25:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-13 13:25:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:25:23,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:23,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:25:23,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:23,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1895441916, now seen corresponding path program 1 times [2024-10-13 13:25:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665143632] [2024-10-13 13:25:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665143632] [2024-10-13 13:25:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665143632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:23,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:25:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280534617] [2024-10-13 13:25:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:23,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:25:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:25:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:25:23,858 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:23,912 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-10-13 13:25:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-13 13:25:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:23,914 INFO L225 Difference]: With dead ends: 47 [2024-10-13 13:25:23,914 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 13:25:23,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:25:23,916 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:23,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 13:25:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 13:25:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:25:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-13 13:25:23,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2024-10-13 13:25:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-13 13:25:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-13 13:25:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 13:25:23,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:23,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:25:23,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 367584173, now seen corresponding path program 1 times [2024-10-13 13:25:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621315617] [2024-10-13 13:25:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:24,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621315617] [2024-10-13 13:25:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621315617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:24,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:25:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265877515] [2024-10-13 13:25:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:24,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:25:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:24,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:25:24,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:25:24,214 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:24,346 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-13 13:25:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:25:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-13 13:25:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:24,351 INFO L225 Difference]: With dead ends: 51 [2024-10-13 13:25:24,351 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 13:25:24,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:25:24,355 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:24,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 13:25:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2024-10-13 13:25:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-13 13:25:24,374 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 19 [2024-10-13 13:25:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-13 13:25:24,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-13 13:25:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 13:25:24,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:24,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:24,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:25:24,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:24,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 367585423, now seen corresponding path program 1 times [2024-10-13 13:25:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465909369] [2024-10-13 13:25:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465909369] [2024-10-13 13:25:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465909369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329324155] [2024-10-13 13:25:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:24,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:24,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:25:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:25:24,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329324155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:24,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 13:25:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291087985] [2024-10-13 13:25:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:24,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:25:24,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:24,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:25:24,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:25:24,652 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:24,688 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-10-13 13:25:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:25:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-13 13:25:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:24,689 INFO L225 Difference]: With dead ends: 52 [2024-10-13 13:25:24,689 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 13:25:24,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:25:24,691 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:24,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 13:25:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2024-10-13 13:25:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-13 13:25:24,705 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2024-10-13 13:25:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:24,706 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-13 13:25:24,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-13 13:25:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 13:25:24,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:24,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:24,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:25:24,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:24,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:24,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1489792460, now seen corresponding path program 1 times [2024-10-13 13:25:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143020148] [2024-10-13 13:25:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:25,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143020148] [2024-10-13 13:25:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143020148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:25,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:25,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:25:25,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320890051] [2024-10-13 13:25:25,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:25,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:25:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:25:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:25:25,074 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:25,155 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-13 13:25:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:25:25,156 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-13 13:25:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:25,157 INFO L225 Difference]: With dead ends: 52 [2024-10-13 13:25:25,158 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 13:25:25,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:25:25,160 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 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-13 13:25:25,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 13:25:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-13 13:25:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-10-13 13:25:25,173 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 20 [2024-10-13 13:25:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:25,175 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-13 13:25:25,175 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-10-13 13:25:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 13:25:25,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:25,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:25,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:25:25,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:25,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1489753731, now seen corresponding path program 1 times [2024-10-13 13:25:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735855599] [2024-10-13 13:25:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735855599] [2024-10-13 13:25:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735855599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579252575] [2024-10-13 13:25:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:25,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:25,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:25,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:25:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:25:25,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579252575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 13:25:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699791290] [2024-10-13 13:25:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:25,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:25:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:25:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:25:25,406 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:25,465 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-13 13:25:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:25,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-13 13:25:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:25,467 INFO L225 Difference]: With dead ends: 51 [2024-10-13 13:25:25,467 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 13:25:25,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:25:25,468 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 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-13 13:25:25,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 13:25:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-10-13 13:25:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-13 13:25:25,479 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 20 [2024-10-13 13:25:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:25,479 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-13 13:25:25,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-13 13:25:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 13:25:25,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:25,480 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:25,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:25,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 13:25:25,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1356283532, now seen corresponding path program 1 times [2024-10-13 13:25:25,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:25,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137498393] [2024-10-13 13:25:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137498393] [2024-10-13 13:25:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137498393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401088263] [2024-10-13 13:25:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:25,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:25,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:25:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:25:25,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401088263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:25,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-13 13:25:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500762440] [2024-10-13 13:25:25,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:25,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:25:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:25,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:25:25,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:25:25,934 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:25:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:26,064 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-10-13 13:25:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:25:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 23 [2024-10-13 13:25:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:26,067 INFO L225 Difference]: With dead ends: 82 [2024-10-13 13:25:26,067 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 13:25:26,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:25:26,068 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:26,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 106 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 13:25:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-10-13 13:25:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-13 13:25:26,077 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 23 [2024-10-13 13:25:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:26,077 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-13 13:25:26,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:25:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-13 13:25:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 13:25:26,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:26,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:26,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:26,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash 904934402, now seen corresponding path program 1 times [2024-10-13 13:25:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:26,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589492487] [2024-10-13 13:25:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589492487] [2024-10-13 13:25:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589492487] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840786902] [2024-10-13 13:25:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:26,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:26,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:25:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:25:26,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:26,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840786902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:26,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-13 13:25:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195278465] [2024-10-13 13:25:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:26,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:25:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:26,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:25:26,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:25:26,521 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:26,595 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-13 13:25:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-13 13:25:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:26,597 INFO L225 Difference]: With dead ends: 59 [2024-10-13 13:25:26,597 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 13:25:26,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:25:26,598 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:26,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 13:25:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2024-10-13 13:25:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:25:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-10-13 13:25:26,611 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2024-10-13 13:25:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-10-13 13:25:26,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-10-13 13:25:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:25:26,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:26,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:26,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:25:26,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:26,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2011804545, now seen corresponding path program 1 times [2024-10-13 13:25:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587165173] [2024-10-13 13:25:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587165173] [2024-10-13 13:25:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587165173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136333207] [2024-10-13 13:25:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:26,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:26,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:25:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:25:26,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:27,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136333207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:27,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-10-13 13:25:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434129610] [2024-10-13 13:25:27,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 13:25:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 13:25:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:25:27,132 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:25:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:27,383 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-10-13 13:25:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 13:25:27,383 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-13 13:25:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:27,384 INFO L225 Difference]: With dead ends: 76 [2024-10-13 13:25:27,384 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 13:25:27,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-13 13:25:27,385 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:27,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 162 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 13:25:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-13 13:25:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:25:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-13 13:25:27,394 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 25 [2024-10-13 13:25:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:27,394 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-13 13:25:27,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:25:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-13 13:25:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 13:25:27,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:27,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:27,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:25:27,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:27,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1808115458, now seen corresponding path program 1 times [2024-10-13 13:25:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102360965] [2024-10-13 13:25:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 13:25:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:25:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 13:25:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:25:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102360965] [2024-10-13 13:25:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102360965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400326334] [2024-10-13 13:25:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:27,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:27,907 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:27,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:25:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 13:25:27,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:28,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:25:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400326334] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:28,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-13 13:25:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655613916] [2024-10-13 13:25:28,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 13:25:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 13:25:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2024-10-13 13:25:28,419 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 13:25:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:29,080 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2024-10-13 13:25:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-13 13:25:29,081 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 53 [2024-10-13 13:25:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:29,082 INFO L225 Difference]: With dead ends: 222 [2024-10-13 13:25:29,082 INFO L226 Difference]: Without dead ends: 221 [2024-10-13 13:25:29,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 96 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-13 13:25:29,086 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 196 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:29,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 242 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:25:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-13 13:25:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2024-10-13 13:25:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.1285714285714286) internal successors, (158), 140 states have internal predecessors, (158), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 13:25:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2024-10-13 13:25:29,116 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 53 [2024-10-13 13:25:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:29,116 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2024-10-13 13:25:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 13:25:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2024-10-13 13:25:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 13:25:29,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:29,118 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:29,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:25:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:29,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:29,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1200701576, now seen corresponding path program 1 times [2024-10-13 13:25:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052053840] [2024-10-13 13:25:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:29,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 13:25:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:25:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:29,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052053840] [2024-10-13 13:25:29,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052053840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827138386] [2024-10-13 13:25:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:29,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:29,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:29,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 13:25:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 13:25:29,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:29,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827138386] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:29,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 15 [2024-10-13 13:25:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570972450] [2024-10-13 13:25:29,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:25:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:25:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:25:29,786 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-13 13:25:29,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:29,930 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-10-13 13:25:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 13:25:29,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-13 13:25:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:29,932 INFO L225 Difference]: With dead ends: 208 [2024-10-13 13:25:29,932 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 13:25:29,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2024-10-13 13:25:29,934 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:29,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 130 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 13:25:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2024-10-13 13:25:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 145 states have (on average 1.1310344827586207) internal successors, (164), 145 states have internal predecessors, (164), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 13:25:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2024-10-13 13:25:29,952 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 61 [2024-10-13 13:25:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:29,952 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2024-10-13 13:25:29,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-13 13:25:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2024-10-13 13:25:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 13:25:29,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:29,954 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:29,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:25:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:30,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:30,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1896600973, now seen corresponding path program 2 times [2024-10-13 13:25:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599300357] [2024-10-13 13:25:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 13:25:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:25:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-13 13:25:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599300357] [2024-10-13 13:25:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599300357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:30,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:25:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701186078] [2024-10-13 13:25:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:30,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:25:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:25:30,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:25:30,234 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:25:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:30,270 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2024-10-13 13:25:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-10-13 13:25:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:30,271 INFO L225 Difference]: With dead ends: 199 [2024-10-13 13:25:30,272 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 13:25:30,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:25:30,273 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:30,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 13:25:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2024-10-13 13:25:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 126 states have (on average 1.119047619047619) internal successors, (141), 126 states have internal predecessors, (141), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 13:25:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2024-10-13 13:25:30,284 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 66 [2024-10-13 13:25:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:30,284 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2024-10-13 13:25:30,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:25:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2024-10-13 13:25:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 13:25:30,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:30,286 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:30,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 13:25:30,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:30,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1708158849, now seen corresponding path program 1 times [2024-10-13 13:25:30,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:30,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165634153] [2024-10-13 13:25:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:25:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:25:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 13:25:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 13:25:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 13:25:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:25:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:25:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 13:25:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 90 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-13 13:25:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165634153] [2024-10-13 13:25:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165634153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020045865] [2024-10-13 13:25:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:30,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:30,472 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:30,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 13:25:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:30,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 13:25:30,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 228 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-13 13:25:30,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-10-13 13:25:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020045865] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:30,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2024-10-13 13:25:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921870365] [2024-10-13 13:25:30,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:30,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 13:25:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 13:25:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:25:30,963 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-10-13 13:25:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:31,329 INFO L93 Difference]: Finished difference Result 248 states and 272 transitions. [2024-10-13 13:25:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 13:25:31,329 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 113 [2024-10-13 13:25:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:31,330 INFO L225 Difference]: With dead ends: 248 [2024-10-13 13:25:31,330 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:25:31,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 226 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 13:25:31,335 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:31,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 292 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:25:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:25:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:25:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:25:31,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-10-13 13:25:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:31,336 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:25:31,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-10-13 13:25:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:25:31,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:25:31,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 13:25:31,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 13:25:31,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 13:25:31,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 13:25:31,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 13:25:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 13:25:31,544 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:31,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:25:31,778 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:25:31,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:25:31 BoogieIcfgContainer [2024-10-13 13:25:31,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:25:31,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:25:31,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:25:31,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:25:31,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:25:23" (3/4) ... [2024-10-13 13:25:31,797 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:25:31,801 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 13:25:31,801 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:25:31,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 13:25:31,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 13:25:31,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:25:31,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:25:31,902 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:25:31,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:25:31,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:25:31,904 INFO L158 Benchmark]: Toolchain (without parser) took 9320.91ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 124.7MB in the beginning and 89.0MB in the end (delta: 35.7MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2024-10-13 13:25:31,904 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 109.1MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:25:31,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.97ms. Allocated memory is still 188.7MB. Free memory was 124.5MB in the beginning and 112.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:25:31,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 188.7MB. Free memory was 112.2MB in the beginning and 110.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:25:31,905 INFO L158 Benchmark]: Boogie Preprocessor took 37.02ms. Allocated memory is still 188.7MB. Free memory was 110.7MB in the beginning and 108.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:25:31,905 INFO L158 Benchmark]: RCFGBuilder took 356.01ms. Allocated memory is still 188.7MB. Free memory was 108.9MB in the beginning and 153.1MB in the end (delta: -44.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-13 13:25:31,905 INFO L158 Benchmark]: TraceAbstraction took 8500.97ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 152.3MB in the beginning and 93.2MB in the end (delta: 59.1MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-10-13 13:25:31,906 INFO L158 Benchmark]: Witness Printer took 108.49ms. Allocated memory is still 232.8MB. Free memory was 93.2MB in the beginning and 89.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:25:31,907 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.15ms. Allocated memory is still 109.1MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.97ms. Allocated memory is still 188.7MB. Free memory was 124.5MB in the beginning and 112.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 188.7MB. Free memory was 112.2MB in the beginning and 110.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.02ms. Allocated memory is still 188.7MB. Free memory was 110.7MB in the beginning and 108.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.01ms. Allocated memory is still 188.7MB. Free memory was 108.9MB in the beginning and 153.1MB in the end (delta: -44.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8500.97ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 152.3MB in the beginning and 93.2MB in the end (delta: 59.1MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * Witness Printer took 108.49ms. Allocated memory is still 232.8MB. Free memory was 93.2MB in the beginning and 89.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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 3 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 561 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 1541 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1212 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 936 IncrementalHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 329 mSDtfsCounter, 936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 617 SyntacticMatches, 21 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=11, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 132 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 2066 SizeOfPredicates, 40 NumberOfNonLiveVariables, 857 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 1281/1564 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: 40]: Loop Invariant Derived loop invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || ((counter <= 3) && (1 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 5)) || (counter == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:25:31,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE