/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:31:54,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:31:54,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:31:54,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:31:54,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:31:54,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:31:54,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:31:54,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:31:54,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:31:54,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:31:54,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:31:54,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:31:54,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:31:54,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:31:54,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:31:54,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:31:54,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:31:54,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:31:54,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:31:54,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:31:54,786 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:31:54,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:31:54,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:31:54,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:31:54,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:31:54,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:31:54,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:31:54,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:31:54,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:31:54,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:31:54,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:31:54,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:31:54,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:31:54,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:31:54,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:31:54,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:31:54,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:31:54,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:31:54,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:31:54,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:31:54,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:31:54,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:31:54,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:31:54,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:31:54,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:31:54,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:31:54,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:31:54,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:31:54,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:31:54,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:31:54,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:31:54,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:31:54,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:31:54,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:31:54,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:31:54,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:31:54,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:31:54,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:31:54,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:54,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:31:54,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:31:54,827 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:31:54,827 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:31:54,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:31:54,827 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:31:54,828 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:31:55,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:31:55,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:31:55,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:31:55,057 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:31:55,059 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:31:55,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2022-04-15 12:31:55,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8add2ee84/ccd7bc2da294457b9416d218f2f2fcad/FLAG1223ab208 [2022-04-15 12:31:55,477 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:31:55,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2022-04-15 12:31:55,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8add2ee84/ccd7bc2da294457b9416d218f2f2fcad/FLAG1223ab208 [2022-04-15 12:31:55,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8add2ee84/ccd7bc2da294457b9416d218f2f2fcad [2022-04-15 12:31:55,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:31:55,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:31:55,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:55,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:31:55,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:31:55,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:55" (1/1) ... [2022-04-15 12:31:55,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280b614e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:55, skipping insertion in model container [2022-04-15 12:31:55,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:55" (1/1) ... [2022-04-15 12:31:55,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:31:55,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:31:56,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c[1238,1251] [2022-04-15 12:31:56,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:56,069 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:31:56,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c[1238,1251] [2022-04-15 12:31:56,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:56,101 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:31:56,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56 WrapperNode [2022-04-15 12:31:56,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:56,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:31:56,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:31:56,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:31:56,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:31:56,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:31:56,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:31:56,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:31:56,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (1/1) ... [2022-04-15 12:31:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:56,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:31:56,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:31:56,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:31:56,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:31:56,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:31:56,196 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:31:56,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:31:56,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:31:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:31:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:31:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:31:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:31:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:31:56,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:31:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:31:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:31:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:31:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:31:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:31:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:31:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:31:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:31:56,252 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:31:56,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:31:56,380 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:31:56,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:31:56,386 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 12:31:56,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:56 BoogieIcfgContainer [2022-04-15 12:31:56,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:31:56,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:31:56,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:31:56,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:31:56,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:31:55" (1/3) ... [2022-04-15 12:31:56,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42842fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:56, skipping insertion in model container [2022-04-15 12:31:56,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:56" (2/3) ... [2022-04-15 12:31:56,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42842fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:56, skipping insertion in model container [2022-04-15 12:31:56,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:56" (3/3) ... [2022-04-15 12:31:56,423 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+lhb-reducer.c [2022-04-15 12:31:56,427 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:31:56,427 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:31:56,473 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:31:56,479 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 12:31:56,479 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:31:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:31:56,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:56,506 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:56,506 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash -782080232, now seen corresponding path program 1 times [2022-04-15 12:31:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:56,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256426903] [2022-04-15 12:31:56,527 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -782080232, now seen corresponding path program 2 times [2022-04-15 12:31:56,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:56,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092682531] [2022-04-15 12:31:56,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:56,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {21#true} is VALID [2022-04-15 12:31:56,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:31:56,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-15 12:31:56,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:56,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {21#true} is VALID [2022-04-15 12:31:56,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:31:56,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-15 12:31:56,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-15 12:31:56,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__y~0 := #t~nondet4;havoc #t~nondet4; {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:56,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:56,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:56,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 12:31:56,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 12:31:56,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {28#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:31:56,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {22#false} is VALID [2022-04-15 12:31:56,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:31:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:56,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092682531] [2022-04-15 12:31:56,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092682531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:56,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:56,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:56,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:56,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256426903] [2022-04-15 12:31:56,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256426903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:56,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:56,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62285201] [2022-04-15 12:31:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:31:56,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:56,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:56,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:56,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:31:56,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:31:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:31:56,902 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:57,200 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 12:31:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:31:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:31:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 12:31:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 12:31:57,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-15 12:31:57,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:57,290 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:31:57,290 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:31:57,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:31:57,297 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:57,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:31:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:31:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:31:57,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:57,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,345 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,345 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:57,349 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:31:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:31:57,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:57,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:57,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:31:57,350 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:31:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:57,353 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:31:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:31:57,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:57,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:57,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:57,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:31:57,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-15 12:31:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:57,357 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:31:57,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:57,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:31:57,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:31:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:31:57,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:57,375 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:57,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:31:57,375 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:57,376 INFO L85 PathProgramCache]: Analyzing trace with hash 38085627, now seen corresponding path program 1 times [2022-04-15 12:31:57,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:57,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282311451] [2022-04-15 12:31:57,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 38085627, now seen corresponding path program 2 times [2022-04-15 12:31:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:57,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637052509] [2022-04-15 12:31:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:57,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {168#true} is VALID [2022-04-15 12:31:57,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 12:31:57,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-15 12:31:57,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:57,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {168#true} is VALID [2022-04-15 12:31:57,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 12:31:57,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-15 12:31:57,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-15 12:31:57,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__y~0 := #t~nondet4;havoc #t~nondet4; {173#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:57,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {173#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {173#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:57,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {173#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {173#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:57,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 12:31:57,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 12:31:57,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 12:31:57,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 12:31:57,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {176#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:31:57,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {176#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {169#false} is VALID [2022-04-15 12:31:57,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-15 12:31:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:57,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:57,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637052509] [2022-04-15 12:31:57,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637052509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:31:57,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208164116] [2022-04-15 12:31:57,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:31:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:31:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:31:57,503 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) [2022-04-15 12:31:57,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:31:57,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:31:57,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:31:57,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:31:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:57,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:31:57,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-15 12:31:57,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {168#true} is VALID [2022-04-15 12:31:57,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 12:31:57,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-15 12:31:57,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-15 12:31:57,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__y~0 := #t~nondet4;havoc #t~nondet4; {173#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:57,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {173#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {173#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:57,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {173#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {173#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 12:31:57,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 12:31:57,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 12:31:57,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#(<= (+ 51 main_~main__x~0) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 12:31:57,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 12:31:57,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {217#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:31:57,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {169#false} is VALID [2022-04-15 12:31:57,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-15 12:31:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:57,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:31:58,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-15 12:31:58,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {169#false} is VALID [2022-04-15 12:31:58,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {217#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 12:31:58,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {230#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-15 12:31:58,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {230#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-15 12:31:58,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {237#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} is VALID [2022-04-15 12:31:58,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(< main_~main__x~0 3)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0;~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {237#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} is VALID [2022-04-15 12:31:58,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(< main_~main__x~0 3)} assume !!(~main__y~0 < 1000000); {244#(< main_~main__x~0 3)} is VALID [2022-04-15 12:31:58,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(< main_~main__x~0 3)} assume !!(-1000 < ~main__y~0); {244#(< main_~main__x~0 3)} is VALID [2022-04-15 12:31:58,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__y~0 := #t~nondet4;havoc #t~nondet4; {244#(< main_~main__x~0 3)} is VALID [2022-04-15 12:31:58,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-15 12:31:58,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-15 12:31:58,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 12:31:58,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {168#true} is VALID [2022-04-15 12:31:58,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-15 12:31:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:31:58,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208164116] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:31:58,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:31:58,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2022-04-15 12:31:58,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:58,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282311451] [2022-04-15 12:31:58,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282311451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:58,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:58,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:31:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117099904] [2022-04-15 12:31:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:58,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:31:58,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:58,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:58,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:58,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:31:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:58,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:31:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:31:58,188 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:58,270 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:31:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:31:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:31:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-15 12:31:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-15 12:31:58,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2022-04-15 12:31:58,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:58,289 INFO L225 Difference]: With dead ends: 16 [2022-04-15 12:31:58,289 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:31:58,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:31:58,292 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:58,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:31:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:31:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:31:58,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:58,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-15 12:31:58,294 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-15 12:31:58,294 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-15 12:31:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:58,294 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:31:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:31:58,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:58,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:58,295 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 12:31:58,295 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 12:31:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:58,295 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:31:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:31:58,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:58,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:58,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:58,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:58,296 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) [2022-04-15 12:31:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:31:58,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-15 12:31:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:58,296 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:31:58,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:31:58,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:31:58,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:31:58,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:58,299 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:31:58,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 12:31:58,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:31:58,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:31:58,693 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 12:31:58,693 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 12:31:58,693 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 12:31:58,693 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-15 12:31:58,693 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 12:31:58,694 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-15 12:31:58,694 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-15 12:31:58,694 INFO L878 garLoopResultBuilder]: At program point L32(lines 32 71) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (<= (+ main_~main__x~0 50) 0)) [2022-04-15 12:31:58,694 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 57) the Hoare annotation is: false [2022-04-15 12:31:58,694 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 14 74) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|)) [2022-04-15 12:31:58,694 INFO L878 garLoopResultBuilder]: At program point L26(lines 26 72) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (<= (+ main_~main__x~0 50) 0)) [2022-04-15 12:31:58,694 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2022-04-15 12:31:58,695 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 14 74) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (<= (+ main_~main__x~0 50) 0))) [2022-04-15 12:31:58,695 INFO L878 garLoopResultBuilder]: At program point L55(lines 55 64) the Hoare annotation is: (or (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ 51 main_~main__x~0) main_~main__y~0)) (and (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) (<= 1 main_~__VERIFIER_assert__cond~0))) [2022-04-15 12:31:58,695 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 73) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (<= (+ main_~main__x~0 50) 0)) [2022-04-15 12:31:58,695 INFO L878 garLoopResultBuilder]: At program point L46(lines 33 67) the Hoare annotation is: (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) [2022-04-15 12:31:58,695 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 14 74) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (<= (+ main_~main__x~0 50) 0))) [2022-04-15 12:31:58,695 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 66) the Hoare annotation is: (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) [2022-04-15 12:31:58,695 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:31:58,696 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:31:58,696 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:31:58,696 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:31:58,696 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:31:58,696 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:31:58,696 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:31:58,699 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-15 12:31:58,700 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:31:58,703 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:31:58,704 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 12:31:58,705 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:31:58,705 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 12:31:58,705 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 12:31:58,707 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 12:31:58,716 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:31:58,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:31:58 BoogieIcfgContainer [2022-04-15 12:31:58,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:31:58,725 INFO L158 Benchmark]: Toolchain (without parser) took 2836.46ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 152.2MB in the beginning and 102.8MB in the end (delta: 49.4MB). Peak memory consumption was 85.6MB. Max. memory is 8.0GB. [2022-04-15 12:31:58,726 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 179.3MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:31:58,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.40ms. Allocated memory is still 179.3MB. Free memory was 151.9MB in the beginning and 149.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-15 12:31:58,726 INFO L158 Benchmark]: Boogie Preprocessor took 31.28ms. Allocated memory is still 179.3MB. Free memory was 149.5MB in the beginning and 148.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:58,726 INFO L158 Benchmark]: RCFGBuilder took 266.52ms. Allocated memory is still 179.3MB. Free memory was 148.0MB in the beginning and 137.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:31:58,727 INFO L158 Benchmark]: TraceAbstraction took 2321.77ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 136.8MB in the beginning and 102.8MB in the end (delta: 34.1MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-04-15 12:31:58,728 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 179.3MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.40ms. Allocated memory is still 179.3MB. Free memory was 151.9MB in the beginning and 149.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.28ms. Allocated memory is still 179.3MB. Free memory was 149.5MB in the beginning and 148.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 266.52ms. Allocated memory is still 179.3MB. Free memory was 148.0MB in the beginning and 137.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2321.77ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 136.8MB in the beginning and 102.8MB in the end (delta: 34.1MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. * 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: 57]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 25 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 31 NumberOfFragments, 137 HoareAnnotationTreeSize, 18 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: main__x < 0 || 0 < main__y - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || ((\old(__return_65) == __return_65 && __tmp_55_0 == \old(__tmp_55_0)) && main__x + 50 <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 12:31:58,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...