/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:14:07,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:14:07,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:14:07,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:14:07,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:14:07,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:14:07,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:14:07,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:14:07,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:14:07,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:14:07,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:14:07,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:14:07,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:14:07,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:14:07,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:14:07,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:14:07,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:14:07,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:14:07,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:14:07,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:14:07,985 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:14:07,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:14:07,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:14:07,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:14:07,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:14:07,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:14:07,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:14:07,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:14:07,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:14:07,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:14:07,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:14:07,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:14:07,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:14:07,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:14:07,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:14:07,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:14:07,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:14:07,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:14:07,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:14:07,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:14:07,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:14:07,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:14:07,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:14:08,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:14:08,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:14:08,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:14:08,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:14:08,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:14:08,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:14:08,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:14:08,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:14:08,005 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:14:08,005 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 06:14:08,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:14:08,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:14:08,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:14:08,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:14:08,232 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:14:08,233 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+cfa-reducer.c [2022-04-15 06:14:08,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cc8a004/77480b004cbd4ceb98351f898a17f219/FLAG9386b3fc4 [2022-04-15 06:14:08,646 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:14:08,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2022-04-15 06:14:08,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cc8a004/77480b004cbd4ceb98351f898a17f219/FLAG9386b3fc4 [2022-04-15 06:14:09,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cc8a004/77480b004cbd4ceb98351f898a17f219 [2022-04-15 06:14:09,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:14:09,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:14:09,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:14:09,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:14:09,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:14:09,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7464b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09, skipping insertion in model container [2022-04-15 06:14:09,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:14:09,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:14:09,177 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+cfa-reducer.c[986,999] [2022-04-15 06:14:09,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:14:09,185 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:14:09,195 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+cfa-reducer.c[986,999] [2022-04-15 06:14:09,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:14:09,204 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:14:09,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09 WrapperNode [2022-04-15 06:14:09,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:14:09,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:14:09,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:14:09,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:14:09,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:14:09,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:14:09,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:14:09,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:14:09,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (1/1) ... [2022-04-15 06:14:09,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:14:09,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:09,245 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 06:14:09,247 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 06:14:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:14:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:14:09,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:14:09,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:14:09,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:14:09,314 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:14:09,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:14:09,410 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:14:09,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:14:09,417 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 06:14:09,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:09 BoogieIcfgContainer [2022-04-15 06:14:09,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:14:09,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:14:09,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:14:09,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:14:09,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:14:09" (1/3) ... [2022-04-15 06:14:09,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f58d045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:09, skipping insertion in model container [2022-04-15 06:14:09,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:09" (2/3) ... [2022-04-15 06:14:09,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f58d045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:09, skipping insertion in model container [2022-04-15 06:14:09,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:09" (3/3) ... [2022-04-15 06:14:09,424 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+cfa-reducer.c [2022-04-15 06:14:09,427 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:14:09,428 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:14:09,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:14:09,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 06:14:09,480 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:14:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 06:14:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:14:09,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:09,523 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:09,523 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1088558671, now seen corresponding path program 1 times [2022-04-15 06:14:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:09,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049724144] [2022-04-15 06:14:09,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:14:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1088558671, now seen corresponding path program 2 times [2022-04-15 06:14:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:09,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457171482] [2022-04-15 06:14:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:09,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:09,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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;~__return_65~0 := 0; {19#true} is VALID [2022-04-15 06:14:09,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-15 06:14:09,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #38#return; {19#true} is VALID [2022-04-15 06:14:09,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:09,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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;~__return_65~0 := 0; {19#true} is VALID [2022-04-15 06:14:09,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-15 06:14:09,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #38#return; {19#true} is VALID [2022-04-15 06:14:09,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-15 06:14:09,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#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; {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:09,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:09,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:09,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#(<= (+ main_~main__x~0 50) 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; {20#false} is VALID [2022-04-15 06:14:09,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2022-04-15 06:14:09,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-15 06:14:09,766 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 06:14:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:09,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457171482] [2022-04-15 06:14:09,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457171482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:09,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:09,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:14:09,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:09,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049724144] [2022-04-15 06:14:09,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049724144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:09,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:09,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:14:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815634205] [2022-04-15 06:14:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:09,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2022-04-15 06:14:09,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:09,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:14:09,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:09,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:14:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:14:09,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:14:09,823 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:14:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:09,912 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 06:14:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:14:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2022-04-15 06:14:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:14:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:14:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:14:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:14:09,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-15 06:14:09,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:09,955 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:14:09,955 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 06:14:09,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:14:09,959 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:09,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 06:14:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 06:14:09,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:09,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 06:14:09,983 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 06:14:09,983 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 06:14:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:09,985 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 06:14:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:14:09,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:09,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:09,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-15 06:14:09,986 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-15 06:14:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:09,988 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 06:14:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:14:09,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:09,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:09,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:09,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 06:14:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 06:14:09,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 06:14:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:09,990 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 06:14:09,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 06:14:09,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 06:14:10,003 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 06:14:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:14:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:14:10,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:10,004 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:10,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:14:10,004 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash 614357099, now seen corresponding path program 1 times [2022-04-15 06:14:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856195854] [2022-04-15 06:14:10,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:14:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 614357099, now seen corresponding path program 2 times [2022-04-15 06:14:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:10,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571486226] [2022-04-15 06:14:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:10,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {142#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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;~__return_65~0 := 0; {134#true} is VALID [2022-04-15 06:14:10,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 06:14:10,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 06:14:10,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {142#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:10,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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;~__return_65~0 := 0; {134#true} is VALID [2022-04-15 06:14:10,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 06:14:10,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 06:14:10,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret5 := main(); {134#true} is VALID [2022-04-15 06:14:10,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#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; {139#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {139#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {139#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#(<= (+ 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; {140#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 06:14:10,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#(<= (+ 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; {141#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 06:14:10,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {135#false} is VALID [2022-04-15 06:14:10,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-04-15 06:14:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:10,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571486226] [2022-04-15 06:14:10,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571486226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391225150] [2022-04-15 06:14:10,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:14:10,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:10,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:10,093 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 06:14:10,094 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 06:14:10,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:14:10,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:10,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:14:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:10,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:10,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2022-04-15 06:14:10,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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;~__return_65~0 := 0; {134#true} is VALID [2022-04-15 06:14:10,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 06:14:10,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 06:14:10,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret5 := main(); {134#true} is VALID [2022-04-15 06:14:10,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#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; {139#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {139#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {139#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#(<= (+ 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; {140#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 06:14:10,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#(<= (+ 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; {173#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 06:14:10,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {135#false} is VALID [2022-04-15 06:14:10,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-04-15 06:14:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:10,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:10,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-04-15 06:14:10,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {135#false} is VALID [2022-04-15 06:14:10,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#(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; {173#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 06:14:10,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(< main_~main__x~0 1)} 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; {186#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-15 06:14:10,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(< main_~main__x~0 1)} assume !!(~main__y~0 < 1000000); {190#(< main_~main__x~0 1)} is VALID [2022-04-15 06:14:10,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(< main_~main__x~0 1)} assume !!(-1000 < ~main__y~0); {190#(< main_~main__x~0 1)} is VALID [2022-04-15 06:14:10,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#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; {190#(< main_~main__x~0 1)} is VALID [2022-04-15 06:14:10,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret5 := main(); {134#true} is VALID [2022-04-15 06:14:10,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 06:14:10,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 06:14:10,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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;~__return_65~0 := 0; {134#true} is VALID [2022-04-15 06:14:10,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2022-04-15 06:14:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391225150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:10,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:10,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-15 06:14:10,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856195854] [2022-04-15 06:14:10,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856195854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:10,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:10,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:14:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633156109] [2022-04-15 06:14:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2022-04-15 06:14:10,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:10,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 06:14:10,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:10,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:14:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:10,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:14:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:14:10,469 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 06:14:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:10,558 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 06:14:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:14:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2022-04-15 06:14:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 06:14:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-15 06:14:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 06:14:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-15 06:14:10,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-15 06:14:10,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:10,577 INFO L225 Difference]: With dead ends: 17 [2022-04-15 06:14:10,577 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:14:10,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:14:10,578 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:10,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:14:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:14:10,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:10,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 06:14:10,585 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 06:14:10,585 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 06:14:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:10,586 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:14:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:14:10,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:10,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:10,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-15 06:14:10,587 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-15 06:14:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:10,588 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:14:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:14:10,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:10,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:10,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:10,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 06:14:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 06:14:10,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 06:14:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:10,589 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 06:14:10,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 06:14:10,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 06:14:10,601 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 06:14:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:14:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:14:10,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:10,601 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:10,621 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-15 06:14:10,818 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 06:14:10,818 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1865138417, now seen corresponding path program 3 times [2022-04-15 06:14:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170524150] [2022-04-15 06:14:10,819 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:14:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1865138417, now seen corresponding path program 4 times [2022-04-15 06:14:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:10,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18911069] [2022-04-15 06:14:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:10,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {322#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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;~__return_65~0 := 0; {313#true} is VALID [2022-04-15 06:14:10,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-15 06:14:10,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} #38#return; {313#true} is VALID [2022-04-15 06:14:10,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {322#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:10,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {322#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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;~__return_65~0 := 0; {313#true} is VALID [2022-04-15 06:14:10,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-15 06:14:10,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #38#return; {313#true} is VALID [2022-04-15 06:14:10,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret5 := main(); {313#true} is VALID [2022-04-15 06:14:10,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#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; {318#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {318#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {318#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {318#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 06:14:10,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {318#(<= (+ 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; {319#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 06:14:10,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#(<= (+ 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~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {320#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 06:14:10,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#(<= (+ 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; {321#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 06:14:10,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {314#false} is VALID [2022-04-15 06:14:10,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-04-15 06:14:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18911069] [2022-04-15 06:14:10,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18911069] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691072876] [2022-04-15 06:14:10,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:14:10,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:10,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:10,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:14:10,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:14:10,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:10,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:14:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:10,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:11,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {313#true} is VALID [2022-04-15 06:14:11,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#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;~__return_65~0 := 0; {313#true} is VALID [2022-04-15 06:14:11,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-15 06:14:11,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #38#return; {313#true} is VALID [2022-04-15 06:14:11,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret5 := main(); {313#true} is VALID [2022-04-15 06:14:11,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#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; {313#true} is VALID [2022-04-15 06:14:11,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} assume !!(-1000 < ~main__y~0); {313#true} is VALID [2022-04-15 06:14:11,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} assume !!(~main__y~0 < 1000000); {313#true} is VALID [2022-04-15 06:14:11,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} 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; {350#(< (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2022-04-15 06:14:11,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {350#(< (+ main_~main__x~0 1) main_~main__y~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; {354#(< (div (+ (- 2) (* (- 1) main_~main__x~0)) (- 2)) main_~main__y~0)} is VALID [2022-04-15 06:14:11,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#(< (div (+ (- 2) (* (- 1) 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; {358#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 06:14:11,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {314#false} is VALID [2022-04-15 06:14:11,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-04-15 06:14:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:11,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:11,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-04-15 06:14:11,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {314#false} is VALID [2022-04-15 06:14:11,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#(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; {358#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 06:14:11,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(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~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {371#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-15 06:14:11,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} 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; {375#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} is VALID [2022-04-15 06:14:11,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} assume !!(~main__y~0 < 1000000); {313#true} is VALID [2022-04-15 06:14:11,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} assume !!(-1000 < ~main__y~0); {313#true} is VALID [2022-04-15 06:14:11,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#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; {313#true} is VALID [2022-04-15 06:14:11,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret5 := main(); {313#true} is VALID [2022-04-15 06:14:11,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #38#return; {313#true} is VALID [2022-04-15 06:14:11,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-15 06:14:11,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#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;~__return_65~0 := 0; {313#true} is VALID [2022-04-15 06:14:11,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {313#true} is VALID [2022-04-15 06:14:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:11,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691072876] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:11,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:14:11,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2022-04-15 06:14:11,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:11,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170524150] [2022-04-15 06:14:11,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170524150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:11,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:11,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:14:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541953582] [2022-04-15 06:14:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:11,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2022-04-15 06:14:11,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:11,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:14:11,598 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 06:14:11,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:14:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:14:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:14:11,599 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:14:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:11,646 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:14:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:14:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2022-04-15 06:14:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:14:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-04-15 06:14:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:14:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-04-15 06:14:11,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 12 transitions. [2022-04-15 06:14:11,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:11,659 INFO L225 Difference]: With dead ends: 14 [2022-04-15 06:14:11,659 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:14:11,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:14:11,660 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:11,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:14:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:14:11,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:11,661 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 06:14:11,661 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 06:14:11,661 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 06:14:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:11,661 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:14:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:11,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:11,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:11,662 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 06:14:11,662 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 06:14:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:11,662 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:14:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:11,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:11,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:11,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:11,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:11,662 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 06:14:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:14:11,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 06:14:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:11,663 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:14:11,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:14:11,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:14:11,663 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 06:14:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:11,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:11,665 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:14:11,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:14:11,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 06:14:11,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-15 06:14:11,950 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) the Hoare annotation is: false [2022-04-15 06:14:11,951 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 60) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2022-04-15 06:14:11,951 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 58) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 50) 0)) [2022-04-15 06:14:11,951 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 60) the Hoare annotation is: true [2022-04-15 06:14:11,951 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 59) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (<= (+ main_~main__x~0 50) 0)) [2022-04-15 06:14:11,951 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: false [2022-04-15 06:14:11,951 INFO L878 garLoopResultBuilder]: At program point L46(lines 46 55) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0))) (or (and (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) .cse0 (<= 1 main_~__VERIFIER_assert__cond~0)) (and (not (= main_~__VERIFIER_assert__cond~0 0)) .cse0 (<= (+ 51 main_~main__x~0) main_~main__y~0)))) [2022-04-15 06:14:11,951 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 60) the Hoare annotation is: true [2022-04-15 06:14:11,951 INFO L878 garLoopResultBuilder]: At program point L37(lines 30 58) the Hoare annotation is: (and (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) (= |old(~__return_65~0)| ~__return_65~0)) [2022-04-15 06:14:11,951 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:14:11,951 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) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 06:14:11,951 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:14:11,951 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:14:11,952 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:14:11,952 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:14:11,952 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:14:11,954 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-15 06:14:11,955 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:14:11,957 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:14:11,958 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:14:11,958 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 06:14:11,959 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 06:14:11,959 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 06:14:11,959 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 06:14:11,963 INFO L163 areAnnotationChecker]: CFG has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:14:11,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:14:11 BoogieIcfgContainer [2022-04-15 06:14:11,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:14:11,970 INFO L158 Benchmark]: Toolchain (without parser) took 2937.36ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 154.0MB in the beginning and 162.7MB in the end (delta: -8.7MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. [2022-04-15 06:14:11,971 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:14:11,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.96ms. Allocated memory is still 179.3MB. Free memory was 153.8MB in the beginning and 153.2MB in the end (delta: 580.4kB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-15 06:14:11,971 INFO L158 Benchmark]: Boogie Preprocessor took 16.93ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 151.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:14:11,971 INFO L158 Benchmark]: RCFGBuilder took 196.03ms. Allocated memory is still 179.3MB. Free memory was 151.6MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 06:14:11,972 INFO L158 Benchmark]: TraceAbstraction took 2549.78ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 140.7MB in the beginning and 162.7MB in the end (delta: -22.0MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2022-04-15 06:14:11,973 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.09ms. Allocated memory is still 179.3MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.96ms. Allocated memory is still 179.3MB. Free memory was 153.8MB in the beginning and 153.2MB in the end (delta: 580.4kB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.93ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 151.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 196.03ms. Allocated memory is still 179.3MB. Free memory was 151.6MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2549.78ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 140.7MB in the beginning and 162.7MB in the end (delta: -22.0MB). Peak memory consumption was 20.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: 48]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 31 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 26 NumberOfFragments, 83 HoareAnnotationTreeSize, 16 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 30]: Loop Invariant Derived loop invariant: (main__x < 0 || 0 < main__y) && \old(__return_65) == __return_65 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:14:11,997 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...