/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-34549b5 [2022-04-08 09:39:32,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:39:32,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:39:32,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:39:32,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:39:32,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:39:32,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:39:32,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:39:32,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:39:32,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:39:32,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:39:32,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:39:32,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:39:32,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:39:32,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:39:32,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:39:32,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:39:32,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:39:32,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:39:32,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:39:32,271 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:39:32,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:39:32,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:39:32,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:39:32,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:39:32,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:39:32,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:39:32,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:39:32,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:39:32,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:39:32,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:39:32,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:39:32,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:39:32,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:39:32,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:39:32,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:39:32,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:39:32,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:39:32,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:39:32,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:39:32,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:39:32,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:39:32,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:39:32,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:39:32,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:39:32,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:39:32,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:39:32,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:39:32,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:39:32,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:39:32,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:39:32,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:39:32,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:39:32,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:39:32,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:39:32,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:39:32,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:39:32,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:39:32,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:32,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:39:32,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:39:32,295 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:39:32,295 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:39:32,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:39:32,295 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:39:32,295 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-08 09:39:32,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:39:32,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:39:32,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:39:32,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:39:32,515 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:39:32,515 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-08 09:39:32,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3d224be/cf0081634c704bcf981f46f66309cccc/FLAGbe08742c2 [2022-04-08 09:39:32,932 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:39:32,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2022-04-08 09:39:32,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3d224be/cf0081634c704bcf981f46f66309cccc/FLAGbe08742c2 [2022-04-08 09:39:32,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3d224be/cf0081634c704bcf981f46f66309cccc [2022-04-08 09:39:32,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:39:32,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:39:32,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:32,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:39:32,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:39:32,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:32" (1/1) ... [2022-04-08 09:39:32,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22820ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:32, skipping insertion in model container [2022-04-08 09:39:32,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:32" (1/1) ... [2022-04-08 09:39:32,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:39:32,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:39:33,114 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-08 09:39:33,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:33,122 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:39:33,134 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-08 09:39:33,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:33,142 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:39:33,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33 WrapperNode [2022-04-08 09:39:33,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:33,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:39:33,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:39:33,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:39:33,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:39:33,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:39:33,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:39:33,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:39:33,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (1/1) ... [2022-04-08 09:39:33,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:33,211 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-08 09:39:33,227 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-08 09:39:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:39:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:39:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:39:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:39:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:39:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:39:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:39:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:39:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:39:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:39:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:39:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:39:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:39:33,290 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:39:33,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:39:33,385 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:39:33,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:39:33,405 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 09:39:33,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:33 BoogieIcfgContainer [2022-04-08 09:39:33,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:39:33,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:39:33,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:39:33,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:39:33,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:39:32" (1/3) ... [2022-04-08 09:39:33,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f13d1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:33, skipping insertion in model container [2022-04-08 09:39:33,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:33" (2/3) ... [2022-04-08 09:39:33,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f13d1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:33, skipping insertion in model container [2022-04-08 09:39:33,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:33" (3/3) ... [2022-04-08 09:39:33,412 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+lhb-reducer.c [2022-04-08 09:39:33,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:39:33,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:39:33,441 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:39:33,456 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-08 09:39:33,456 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:39:33,492 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-08 09:39:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:39:33,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:33,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:33,498 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash -782080232, now seen corresponding path program 1 times [2022-04-08 09:39:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:33,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333349139] [2022-04-08 09:39:33,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:39:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -782080232, now seen corresponding path program 2 times [2022-04-08 09:39:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013045190] [2022-04-08 09:39:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:33,739 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-08 09:39:33,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:39:33,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-08 09:39:33,741 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-08 09:39:33,742 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-08 09:39:33,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:39:33,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #43#return; {21#true} is VALID [2022-04-08 09:39:33,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-08 09:39:33,743 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-08 09:39:33,745 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-08 09:39:33,745 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-08 09:39:33,746 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-08 09:39:33,747 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-08 09:39:33,747 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-08 09:39:33,748 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-08 09:39:33,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-08 09:39:33,748 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-08 09:39:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013045190] [2022-04-08 09:39:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013045190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:33,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:33,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:39:33,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:33,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [333349139] [2022-04-08 09:39:33,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [333349139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:33,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:33,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:39:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461314862] [2022-04-08 09:39:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:33,755 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-08 09:39:33,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:33,758 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-08 09:39:33,784 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-08 09:39:33,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:39:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:39:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:39:33,808 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-08 09:39:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:34,045 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 09:39:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:39:34,046 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-08 09:39:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:34,047 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-08 09:39:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-08 09:39:34,052 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-08 09:39:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-08 09:39:34,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-08 09:39:34,105 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-08 09:39:34,115 INFO L225 Difference]: With dead ends: 33 [2022-04-08 09:39:34,115 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:39:34,118 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-08 09:39:34,122 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-08 09:39:34,123 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-08 09:39:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:39:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:39:34,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:34,154 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-08 09:39:34,154 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-08 09:39:34,155 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-08 09:39:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:34,159 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:34,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:34,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:34,159 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-08 09:39:34,160 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-08 09:39:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:34,163 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:34,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:34,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:34,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:34,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:34,165 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-08 09:39:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:39:34,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-08 09:39:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:34,180 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:39:34,181 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-08 09:39:34,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:39:34,195 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-08 09:39:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:39:34,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:34,196 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:34,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:39:34,197 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 38085627, now seen corresponding path program 1 times [2022-04-08 09:39:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712663996] [2022-04-08 09:39:34,199 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:39:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 38085627, now seen corresponding path program 2 times [2022-04-08 09:39:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:34,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132453511] [2022-04-08 09:39:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:34,309 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-08 09:39:34,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 09:39:34,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-08 09:39:34,310 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-08 09:39:34,310 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-08 09:39:34,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 09:39:34,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-08 09:39:34,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-08 09:39:34,327 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-08 09:39:34,328 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-08 09:39:34,329 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-08 09:39:34,329 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-08 09:39:34,330 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-08 09:39:34,331 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-08 09:39:34,331 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-08 09:39:34,332 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-08 09:39:34,332 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-08 09:39:34,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-08 09:39:34,333 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-08 09:39:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:34,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132453511] [2022-04-08 09:39:34,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132453511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359490109] [2022-04-08 09:39:34,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:39:34,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:34,336 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-08 09:39:34,337 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-08 09:39:34,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:39:34,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:34,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:39:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:34,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:34,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-08 09:39:34,737 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-08 09:39:34,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 09:39:34,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-08 09:39:34,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-08 09:39:34,738 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-08 09:39:34,738 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-08 09:39:34,739 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-08 09:39:34,739 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-08 09:39:34,740 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-08 09:39:34,741 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-08 09:39:34,741 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-08 09:39:34,742 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-08 09:39:34,742 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-08 09:39:34,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-08 09:39:34,743 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-08 09:39:34,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:34,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-08 09:39:34,972 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-08 09:39:34,973 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-08 09:39:34,974 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-08 09:39:34,975 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-08 09:39:34,975 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-08 09:39:34,977 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-08 09:39:34,978 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-08 09:39:34,978 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-08 09:39:34,979 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-08 09:39:34,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-08 09:39:34,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #43#return; {168#true} is VALID [2022-04-08 09:39:34,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 09:39:34,980 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-08 09:39:34,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-08 09:39:34,980 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-08 09:39:34,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359490109] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:34,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:39:34,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2022-04-08 09:39:34,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:34,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712663996] [2022-04-08 09:39:34,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712663996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:34,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:34,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:39:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773363111] [2022-04-08 09:39:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:34,984 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-08 09:39:34,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:34,985 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-08 09:39:34,996 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-08 09:39:34,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:39:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:39:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:39:34,997 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-08 09:39:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:35,063 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:39:35,063 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-08 09:39:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:35,063 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-08 09:39:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-08 09:39:35,066 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-08 09:39:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-08 09:39:35,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2022-04-08 09:39:35,075 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-08 09:39:35,076 INFO L225 Difference]: With dead ends: 16 [2022-04-08 09:39:35,076 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:39:35,077 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-08 09:39:35,079 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-08 09:39:35,082 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-08 09:39:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:39:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:39:35,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:35,084 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-08 09:39:35,084 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-08 09:39:35,085 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-08 09:39:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:35,085 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:35,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:35,093 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-08 09:39:35,093 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-08 09:39:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:35,093 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:35,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:35,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:35,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:35,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:35,094 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-08 09:39:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:39:35,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-08 09:39:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:35,094 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:39:35,094 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-08 09:39:35,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:39:35,095 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-08 09:39:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:35,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:35,097 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:39:35,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:39:35,305 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-08 09:39:35,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:39:35,432 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 09:39:35,432 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 09:39:35,432 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 09:39:35,433 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:39:35,433 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 09:39:35,433 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:39:35,433 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 09:39:35,433 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-08 09:39:35,433 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 57) the Hoare annotation is: false [2022-04-08 09:39:35,434 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-08 09:39:35,434 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-08 09:39:35,434 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2022-04-08 09:39:35,434 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-08 09:39:35,434 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-08 09:39:35,434 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-08 09:39:35,434 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-08 09:39:35,435 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-08 09:39:35,435 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-08 09:39:35,435 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:35,435 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-08 09:39:35,435 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:35,435 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:35,435 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:39:35,436 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:39:35,436 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:35,438 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-08 09:39:35,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:39:35,447 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:35,448 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:39:35,449 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:39:35,450 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:39:35,450 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:39:35,451 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 09:39:35,460 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-08 09:39:35,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:39:35 BoogieIcfgContainer [2022-04-08 09:39:35,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:39:35,472 INFO L158 Benchmark]: Toolchain (without parser) took 2517.92ms. Allocated memory was 201.3MB in the beginning and 320.9MB in the end (delta: 119.5MB). Free memory was 148.2MB in the beginning and 210.5MB in the end (delta: -62.3MB). Peak memory consumption was 58.1MB. Max. memory is 8.0GB. [2022-04-08 09:39:35,472 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:39:35,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.85ms. Allocated memory is still 201.3MB. Free memory was 148.1MB in the beginning and 176.3MB in the end (delta: -28.3MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-04-08 09:39:35,472 INFO L158 Benchmark]: Boogie Preprocessor took 19.25ms. Allocated memory is still 201.3MB. Free memory was 176.3MB in the beginning and 174.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:39:35,473 INFO L158 Benchmark]: RCFGBuilder took 238.89ms. Allocated memory is still 201.3MB. Free memory was 174.9MB in the beginning and 164.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:39:35,473 INFO L158 Benchmark]: TraceAbstraction took 2062.06ms. Allocated memory was 201.3MB in the beginning and 320.9MB in the end (delta: 119.5MB). Free memory was 163.8MB in the beginning and 210.5MB in the end (delta: -46.7MB). Peak memory consumption was 73.7MB. Max. memory is 8.0GB. [2022-04-08 09:39:35,474 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.11ms. Allocated memory is still 201.3MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.85ms. Allocated memory is still 201.3MB. Free memory was 148.1MB in the beginning and 176.3MB in the end (delta: -28.3MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.25ms. Allocated memory is still 201.3MB. Free memory was 176.3MB in the beginning and 174.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.89ms. Allocated memory is still 201.3MB. Free memory was 174.9MB in the beginning and 164.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2062.06ms. Allocated memory was 201.3MB in the beginning and 320.9MB in the end (delta: 119.5MB). Free memory was 163.8MB in the beginning and 210.5MB in the end (delta: -46.7MB). Peak memory consumption was 73.7MB. 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.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, 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.1s 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.1s 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-08 09:39:35,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...