./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89c26eeb2471ea361dc7d29b089a771d019574a0d594170c0c8f43bdd67825ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:23:04,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:23:04,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:23:04,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:23:04,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:23:04,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:23:04,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:23:04,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:23:04,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:23:04,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:23:04,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:23:04,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:23:04,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:23:04,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:23:04,555 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:23:04,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:23:04,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:23:04,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:23:04,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:23:04,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:23:04,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:23:04,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:23:04,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:23:04,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:23:04,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:23:04,560 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:23:04,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:23:04,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:23:04,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:23:04,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:23:04,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:23:04,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:23:04,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:23:04,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:23:04,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:23:04,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:23:04,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:23:04,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:23:04,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:23:04,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:23:04,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:23:04,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:23:04,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:23:04,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:23:04,566 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 -> 89c26eeb2471ea361dc7d29b089a771d019574a0d594170c0c8f43bdd67825ef [2024-11-10 19:23:04,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:23:04,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:23:04,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:23:04,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:23:04,819 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:23:04,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound1.c [2024-11-10 19:23:06,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:23:06,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:23:06,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound1.c [2024-11-10 19:23:06,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6265991f3/4c3dc970962244a69faaa529bf43a98f/FLAGd4eebebc5 [2024-11-10 19:23:06,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6265991f3/4c3dc970962244a69faaa529bf43a98f [2024-11-10 19:23:06,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:23:06,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:23:06,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:23:06,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:23:06,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:23:06,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0c572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06, skipping insertion in model container [2024-11-10 19:23:06,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:23:06,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:23:06,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:23:06,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:23:06,620 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:23:06,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06 WrapperNode [2024-11-10 19:23:06,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:23:06,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:23:06,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:23:06,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:23:06,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,653 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2024-11-10 19:23:06,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:23:06,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:23:06,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:23:06,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:23:06,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,718 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-10 19:23:06,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:23:06,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:23:06,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:23:06,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:23:06,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (1/1) ... [2024-11-10 19:23:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:23:06,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:23:06,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:23:06,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:23:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:23:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:23:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:23:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:23:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 19:23:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:23:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:23:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:23:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:23:06,900 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:23:06,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:23:07,123 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 19:23:07,123 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:23:07,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:23:07,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:23:07,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:23:07 BoogieIcfgContainer [2024-11-10 19:23:07,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:23:07,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:23:07,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:23:07,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:23:07,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:23:06" (1/3) ... [2024-11-10 19:23:07,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1adb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:23:07, skipping insertion in model container [2024-11-10 19:23:07,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:06" (2/3) ... [2024-11-10 19:23:07,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1adb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:23:07, skipping insertion in model container [2024-11-10 19:23:07,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:23:07" (3/3) ... [2024-11-10 19:23:07,145 INFO L112 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound1.c [2024-11-10 19:23:07,164 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:23:07,164 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 19:23:07,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:23:07,222 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;@5b0e52d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:23:07,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 19:23:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.53125) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:23:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 19:23:07,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:07,245 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:07,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1293777676, now seen corresponding path program 1 times [2024-11-10 19:23:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154680509] [2024-11-10 19:23:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154680509] [2024-11-10 19:23:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154680509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:07,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:23:07,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211536296] [2024-11-10 19:23:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:07,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:23:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:23:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:23:07,485 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.53125) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:23:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:07,503 INFO L93 Difference]: Finished difference Result 96 states and 138 transitions. [2024-11-10 19:23:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:23:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-10 19:23:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:07,512 INFO L225 Difference]: With dead ends: 96 [2024-11-10 19:23:07,513 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 19:23:07,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:23:07,518 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:07,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:23:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 19:23:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 19:23:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:23:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-10 19:23:07,552 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2024-11-10 19:23:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:07,553 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-10 19:23:07,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:23:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-10 19:23:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 19:23:07,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:07,555 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:07,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:23:07,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:07,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 933684148, now seen corresponding path program 1 times [2024-11-10 19:23:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492106554] [2024-11-10 19:23:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492106554] [2024-11-10 19:23:07,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492106554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:07,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:23:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995645309] [2024-11-10 19:23:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:07,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:23:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:23:07,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:23:07,727 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:23:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:07,773 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-10 19:23:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:23:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2024-11-10 19:23:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:07,775 INFO L225 Difference]: With dead ends: 49 [2024-11-10 19:23:07,775 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 19:23:07,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:23:07,776 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:07,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:23:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 19:23:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-11-10 19:23:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:23:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-10 19:23:07,783 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 25 [2024-11-10 19:23:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:07,785 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-10 19:23:07,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:23:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-10 19:23:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:23:07,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:07,786 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:07,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:23:07,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:07,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1085066076, now seen corresponding path program 1 times [2024-11-10 19:23:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158664076] [2024-11-10 19:23:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:07,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 19:23:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158664076] [2024-11-10 19:23:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158664076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:08,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:08,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:23:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794472609] [2024-11-10 19:23:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:08,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:23:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:23:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:23:08,022 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:08,151 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-11-10 19:23:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:23:08,152 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-11-10 19:23:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:08,153 INFO L225 Difference]: With dead ends: 96 [2024-11-10 19:23:08,153 INFO L226 Difference]: Without dead ends: 65 [2024-11-10 19:23:08,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:23:08,155 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:08,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:23:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-10 19:23:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2024-11-10 19:23:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 46 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:23:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2024-11-10 19:23:08,163 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 36 [2024-11-10 19:23:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:08,163 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-11-10 19:23:08,163 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-10 19:23:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:23:08,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:08,164 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:08,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:23:08,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash 722690009, now seen corresponding path program 1 times [2024-11-10 19:23:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870803534] [2024-11-10 19:23:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 19:23:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:08,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:08,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870803534] [2024-11-10 19:23:08,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870803534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:08,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:08,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:23:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929360941] [2024-11-10 19:23:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:08,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:23:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:08,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:23:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:23:08,316 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:08,415 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-10 19:23:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:23:08,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-10 19:23:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:08,417 INFO L225 Difference]: With dead ends: 59 [2024-11-10 19:23:08,417 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 19:23:08,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-11-10 19:23:08,420 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:08,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 175 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:23:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 19:23:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-10 19:23:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 46 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:23:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2024-11-10 19:23:08,430 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 37 [2024-11-10 19:23:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:08,430 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2024-11-10 19:23:08,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-10 19:23:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 19:23:08,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:08,431 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:08,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:23:08,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1338252875, now seen corresponding path program 1 times [2024-11-10 19:23:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985557975] [2024-11-10 19:23:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 19:23:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985557975] [2024-11-10 19:23:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985557975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:08,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:23:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26258334] [2024-11-10 19:23:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:08,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:23:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:23:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:23:08,529 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:23:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:08,593 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2024-11-10 19:23:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:23:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-10 19:23:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:08,595 INFO L225 Difference]: With dead ends: 101 [2024-11-10 19:23:08,595 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 19:23:08,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:23:08,596 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:08,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:23:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 19:23:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2024-11-10 19:23:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 51 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:23:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2024-11-10 19:23:08,610 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 41 [2024-11-10 19:23:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:08,611 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-10 19:23:08,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:23:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-10 19:23:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 19:23:08,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:08,615 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:23:08,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1463833818, now seen corresponding path program 1 times [2024-11-10 19:23:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612667400] [2024-11-10 19:23:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 19:23:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:08,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:08,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612667400] [2024-11-10 19:23:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612667400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:08,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 19:23:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107114750] [2024-11-10 19:23:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:23:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:23:08,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:23:08,774 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:08,893 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-10 19:23:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:23:08,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-10 19:23:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:08,894 INFO L225 Difference]: With dead ends: 69 [2024-11-10 19:23:08,897 INFO L226 Difference]: Without dead ends: 68 [2024-11-10 19:23:08,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:23:08,898 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 31 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:08,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 207 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:23:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-10 19:23:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-10 19:23:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 54 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:23:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-10 19:23:08,905 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 42 [2024-11-10 19:23:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:08,905 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-10 19:23:08,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-10 19:23:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 19:23:08,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:08,907 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:08,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:23:08,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1659756470, now seen corresponding path program 1 times [2024-11-10 19:23:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:08,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124086907] [2024-11-10 19:23:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 19:23:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:08,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124086907] [2024-11-10 19:23:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124086907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:23:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:23:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939131571] [2024-11-10 19:23:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:08,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:23:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:23:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:23:08,963 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:23:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:08,993 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2024-11-10 19:23:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:23:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-10 19:23:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:09,010 INFO L225 Difference]: With dead ends: 74 [2024-11-10 19:23:09,012 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 19:23:09,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:23:09,015 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:09,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:23:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 19:23:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 19:23:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.0) internal successors, (28), 28 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:23:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-10 19:23:09,022 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 46 [2024-11-10 19:23:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:09,022 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-10 19:23:09,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:23:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-10 19:23:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 19:23:09,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:23:09,026 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:09,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:23:09,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 19:23:09,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:23:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash -87156973, now seen corresponding path program 1 times [2024-11-10 19:23:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:23:09,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051022252] [2024-11-10 19:23:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:23:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:23:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:23:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:23:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 19:23:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 19:23:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:23:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051022252] [2024-11-10 19:23:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051022252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:23:09,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450394194] [2024-11-10 19:23:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:23:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:23:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:23:09,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:23:09,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:23:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:23:09,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:23:09,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:23:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:23:09,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:23:09,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450394194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:23:09,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:23:09,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2024-11-10 19:23:09,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842318961] [2024-11-10 19:23:09,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:23:09,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:23:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:23:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:23:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:23:09,356 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:23:09,473 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-10 19:23:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 19:23:09,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2024-11-10 19:23:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:23:09,474 INFO L225 Difference]: With dead ends: 36 [2024-11-10 19:23:09,474 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:23:09,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-10 19:23:09,479 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:23:09,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 85 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:23:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:23:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:23:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:23:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:23:09,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-11-10 19:23:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:23:09,481 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:23:09,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:23:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:23:09,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:23:09,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-10 19:23:09,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-10 19:23:09,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-10 19:23:09,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-10 19:23:09,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-10 19:23:09,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-10 19:23:09,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:23:09,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:23:09,692 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:23:09,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:23:09,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:23:09,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:23:09 BoogieIcfgContainer [2024-11-10 19:23:09,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:23:09,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:23:09,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:23:09,756 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:23:09,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:23:07" (3/4) ... [2024-11-10 19:23:09,759 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:23:09,762 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 19:23:09,762 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:23:09,766 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-10 19:23:09,767 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 19:23:09,767 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 19:23:09,767 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:23:09,767 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:23:09,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:23:09,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:23:09,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:23:09,846 INFO L158 Benchmark]: Toolchain (without parser) took 3492.44ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 102.0MB in the beginning and 158.9MB in the end (delta: -56.9MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-10 19:23:09,846 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:23:09,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.02ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 89.0MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 19:23:09,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.21ms. Allocated memory is still 169.9MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:23:09,847 INFO L158 Benchmark]: Boogie Preprocessor took 87.16ms. Allocated memory is still 169.9MB. Free memory was 87.3MB in the beginning and 142.2MB in the end (delta: -54.9MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-11-10 19:23:09,847 INFO L158 Benchmark]: IcfgBuilder took 393.36ms. Allocated memory is still 169.9MB. Free memory was 141.8MB in the beginning and 127.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:23:09,847 INFO L158 Benchmark]: TraceAbstraction took 2615.62ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 127.3MB in the beginning and 164.2MB in the end (delta: -36.9MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-11-10 19:23:09,847 INFO L158 Benchmark]: Witness Printer took 90.11ms. Allocated memory is still 251.7MB. Free memory was 164.2MB in the beginning and 158.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:23:09,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.02ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 89.0MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.21ms. Allocated memory is still 169.9MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.16ms. Allocated memory is still 169.9MB. Free memory was 87.3MB in the beginning and 142.2MB in the end (delta: -54.9MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * IcfgBuilder took 393.36ms. Allocated memory is still 169.9MB. Free memory was 141.8MB in the beginning and 127.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2615.62ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 127.3MB in the beginning and 164.2MB in the end (delta: -36.9MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 90.11ms. Allocated memory is still 251.7MB. Free memory was 164.2MB in the beginning and 158.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: 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, 50 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 1095 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 772 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 323 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 583 SizeOfPredicates, 5 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 221/224 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 6 specifications checked. All of them hold - InvariantResult [Line: 44]: Location Invariant Derived location invariant: null - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (counter == 2) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((2 <= counter) && (counter <= 3)) || (counter == 0)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:23:09,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE