/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:47:05,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:47:05,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:47:05,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:47:05,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:47:05,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:47:05,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:47:05,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:47:05,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:47:05,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:47:05,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:47:05,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:47:05,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:47:05,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:47:05,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:47:05,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:47:05,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:47:05,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:47:05,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:47:05,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:47:05,792 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:47:05,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:47:05,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:47:05,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:47:05,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:47:05,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:47:05,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:47:05,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:47:05,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:47:05,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:47:05,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:47:05,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:47:05,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:47:05,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:47:05,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:47:05,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:47:05,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:47:05,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:47:05,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:47:05,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:47:05,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:47:05,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:47:05,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:47:05,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:47:05,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:47:05,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:47:05,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:47:05,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:47:05,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:47:05,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:47:05,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:47:05,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:47:05,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:47:05,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:47:05,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:47:05,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:47:05,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:47:05,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:47:05,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:47:05,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:47:05,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:47:05,831 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:47:05,831 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:47:05,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:47:05,831 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:47:05,831 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-28 12:47:06,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:47:06,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:47:06,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:47:06,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:47:06,059 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:47:06,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound5.c [2022-04-28 12:47:06,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2a03a8c/d37dac40af374f10b67abab3dc67b885/FLAG5df0629f8 [2022-04-28 12:47:06,506 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:47:06,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound5.c [2022-04-28 12:47:06,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2a03a8c/d37dac40af374f10b67abab3dc67b885/FLAG5df0629f8 [2022-04-28 12:47:06,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2a03a8c/d37dac40af374f10b67abab3dc67b885 [2022-04-28 12:47:06,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:47:06,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:47:06,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:47:06,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:47:06,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:47:06,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28dd8ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06, skipping insertion in model container [2022-04-28 12:47:06,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:47:06,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:47:06,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound5.c[525,538] [2022-04-28 12:47:06,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:47:06,702 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:47:06,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound5.c[525,538] [2022-04-28 12:47:06,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:47:06,728 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:47:06,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06 WrapperNode [2022-04-28 12:47:06,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:47:06,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:47:06,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:47:06,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:47:06,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:47:06,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:47:06,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:47:06,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:47:06,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (1/1) ... [2022-04-28 12:47:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:47:06,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:06,782 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-28 12:47:06,785 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-28 12:47:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:47:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:47:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:47:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:47:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:47:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:47:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:47:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:47:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:47:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:47:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:47:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:47:06,861 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:47:06,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:47:06,990 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:47:06,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:47:06,996 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 12:47:06,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:47:06 BoogieIcfgContainer [2022-04-28 12:47:06,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:47:06,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:47:06,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:47:07,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:47:07,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:47:06" (1/3) ... [2022-04-28 12:47:07,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795f746c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:47:07, skipping insertion in model container [2022-04-28 12:47:07,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:06" (2/3) ... [2022-04-28 12:47:07,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795f746c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:47:07, skipping insertion in model container [2022-04-28 12:47:07,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:47:06" (3/3) ... [2022-04-28 12:47:07,004 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound5.c [2022-04-28 12:47:07,016 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:47:07,016 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:47:07,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:47:07,058 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@149099dc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62632932 [2022-04-28 12:47:07,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:47:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:47:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:47:07,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:07,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:07,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1276201559, now seen corresponding path program 1 times [2022-04-28 12:47:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:07,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813237951] [2022-04-28 12:47:07,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1276201559, now seen corresponding path program 2 times [2022-04-28 12:47:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:07,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577534567] [2022-04-28 12:47:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:47:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:07,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 12:47:07,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 12:47:07,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 12:47:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:47:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:07,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 12:47:07,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 12:47:07,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 12:47:07,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 12:47:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 12:47:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:07,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 12:47:07,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 12:47:07,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 12:47:07,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 12:47:07,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:47:07,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 12:47:07,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 12:47:07,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 12:47:07,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 12:47:07,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 12:47:07,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {32#true} is VALID [2022-04-28 12:47:07,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 12:47:07,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 12:47:07,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 12:47:07,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 12:47:07,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {33#false} is VALID [2022-04-28 12:47:07,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {32#true} is VALID [2022-04-28 12:47:07,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 12:47:07,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 12:47:07,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 12:47:07,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 12:47:07,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {33#false} is VALID [2022-04-28 12:47:07,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 12:47:07,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-28 12:47:07,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 12:47:07,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 12:47:07,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 12:47:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:47:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:07,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577534567] [2022-04-28 12:47:07,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577534567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:07,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:07,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:47:07,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813237951] [2022-04-28 12:47:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813237951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:47:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964795240] [2022-04-28 12:47:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:47:07,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:07,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:47:07,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:07,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:47:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:07,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:47:07,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:47:07,403 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:47:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:07,518 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-28 12:47:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:47:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:47:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:47:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 12:47:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:47:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 12:47:07,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-28 12:47:07,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:07,620 INFO L225 Difference]: With dead ends: 51 [2022-04-28 12:47:07,620 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 12:47:07,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:47:07,626 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:47:07,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:47:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 12:47:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 12:47:07,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:07,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:47:07,653 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:47:07,653 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:47:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:07,657 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 12:47:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 12:47:07,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:07,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:07,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-28 12:47:07,658 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-28 12:47:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:07,662 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 12:47:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 12:47:07,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:07,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:07,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:07,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:47:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 12:47:07,667 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2022-04-28 12:47:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:07,667 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 12:47:07,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:47:07,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 12:47:07,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 12:47:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:47:07,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:07,712 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:07,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:47:07,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1874219407, now seen corresponding path program 1 times [2022-04-28 12:47:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:07,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819636223] [2022-04-28 12:47:07,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1874219407, now seen corresponding path program 2 times [2022-04-28 12:47:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590392084] [2022-04-28 12:47:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:07,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:07,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247622419] [2022-04-28 12:47:07,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:07,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:07,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:07,747 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-28 12:47:07,773 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-28 12:47:07,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:47:07,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:07,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:47:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:07,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:08,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 12:47:08,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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(10, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-28 12:47:08,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 12:47:08,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #61#return; {246#true} is VALID [2022-04-28 12:47:08,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret6 := main(); {246#true} is VALID [2022-04-28 12:47:08,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-28 12:47:08,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {246#true} is VALID [2022-04-28 12:47:08,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 12:47:08,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 12:47:08,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 12:47:08,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 12:47:08,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {246#true} is VALID [2022-04-28 12:47:08,041 INFO L272 TraceCheckUtils]: 12: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {246#true} is VALID [2022-04-28 12:47:08,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 12:47:08,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 12:47:08,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 12:47:08,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 12:47:08,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {246#true} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {302#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 12:47:08,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {302#(and (= main_~y~0 1) (= main_~x~0 1))} assume !false; {302#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 12:47:08,049 INFO L272 TraceCheckUtils]: 19: Hoare triple {302#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:47:08,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:47:08,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 12:47:08,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 12:47:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:47:08,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:47:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:08,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590392084] [2022-04-28 12:47:08,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:08,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247622419] [2022-04-28 12:47:08,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247622419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:08,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:08,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:47:08,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:08,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819636223] [2022-04-28 12:47:08,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819636223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:08,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:08,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:47:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916644652] [2022-04-28 12:47:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:47:08,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:08,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:47:08,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:08,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:47:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:47:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:47:08,081 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:47:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:08,212 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 12:47:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:47:08,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:47:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:47:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 12:47:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:47:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 12:47:08,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-28 12:47:08,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:08,259 INFO L225 Difference]: With dead ends: 34 [2022-04-28 12:47:08,260 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 12:47:08,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:47:08,261 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:47:08,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:47:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 12:47:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 12:47:08,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:08,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:47:08,273 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:47:08,273 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:47:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:08,275 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 12:47:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 12:47:08,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:08,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:08,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-28 12:47:08,277 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-28 12:47:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:08,279 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 12:47:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 12:47:08,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:08,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:08,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:08,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:47:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 12:47:08,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-28 12:47:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:08,282 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 12:47:08,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:47:08,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 12:47:08,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 12:47:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 12:47:08,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:08,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:08,345 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-28 12:47:08,535 WARN L477 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-28 12:47:08,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 156588053, now seen corresponding path program 1 times [2022-04-28 12:47:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:08,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715462224] [2022-04-28 12:47:08,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 156588053, now seen corresponding path program 2 times [2022-04-28 12:47:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:08,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607852181] [2022-04-28 12:47:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:08,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:08,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100565427] [2022-04-28 12:47:08,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:08,565 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-28 12:47:08,567 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-28 12:47:08,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:47:08,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:08,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:47:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:08,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:08,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {513#true} call ULTIMATE.init(); {513#true} is VALID [2022-04-28 12:47:08,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#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(10, 2);call #Ultimate.allocInit(12, 3); {513#true} is VALID [2022-04-28 12:47:08,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:08,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {513#true} {513#true} #61#return; {513#true} is VALID [2022-04-28 12:47:08,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call #t~ret6 := main(); {513#true} is VALID [2022-04-28 12:47:08,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {513#true} is VALID [2022-04-28 12:47:08,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {513#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {513#true} is VALID [2022-04-28 12:47:08,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-28 12:47:08,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-28 12:47:08,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:08,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {513#true} {513#true} #53#return; {513#true} is VALID [2022-04-28 12:47:08,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {513#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {513#true} is VALID [2022-04-28 12:47:08,880 INFO L272 TraceCheckUtils]: 12: Hoare triple {513#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {513#true} is VALID [2022-04-28 12:47:08,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-28 12:47:08,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-28 12:47:08,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:08,880 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {513#true} {513#true} #55#return; {513#true} is VALID [2022-04-28 12:47:08,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#true} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {569#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 12:47:08,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#(and (= main_~y~0 1) (= main_~x~0 1))} assume !false; {569#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 12:47:08,882 INFO L272 TraceCheckUtils]: 19: Hoare triple {569#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {513#true} is VALID [2022-04-28 12:47:08,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-28 12:47:08,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-28 12:47:08,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:08,883 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {513#true} {569#(and (= main_~y~0 1) (= main_~x~0 1))} #57#return; {569#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 12:47:08,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {591#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-28 12:47:08,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {591#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} assume !false; {591#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-28 12:47:08,886 INFO L272 TraceCheckUtils]: 26: Hoare triple {591#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:47:08,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:47:08,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {514#false} is VALID [2022-04-28 12:47:08,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-04-28 12:47:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:47:08,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:47:09,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-04-28 12:47:09,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {514#false} is VALID [2022-04-28 12:47:09,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:47:09,091 INFO L272 TraceCheckUtils]: 26: Hoare triple {618#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:47:09,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {618#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !false; {618#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 12:47:09,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {618#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 12:47:09,204 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {513#true} {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} #57#return; {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-28 12:47:09,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:09,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-28 12:47:09,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-28 12:47:09,204 INFO L272 TraceCheckUtils]: 19: Hoare triple {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {513#true} is VALID [2022-04-28 12:47:09,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !false; {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-28 12:47:09,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#true} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {625#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-28 12:47:09,206 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {513#true} {513#true} #55#return; {513#true} is VALID [2022-04-28 12:47:09,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:09,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-28 12:47:09,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-28 12:47:09,207 INFO L272 TraceCheckUtils]: 12: Hoare triple {513#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {513#true} is VALID [2022-04-28 12:47:09,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {513#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {513#true} is VALID [2022-04-28 12:47:09,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {513#true} {513#true} #53#return; {513#true} is VALID [2022-04-28 12:47:09,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:09,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-28 12:47:09,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-28 12:47:09,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {513#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {513#true} is VALID [2022-04-28 12:47:09,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {513#true} is VALID [2022-04-28 12:47:09,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call #t~ret6 := main(); {513#true} is VALID [2022-04-28 12:47:09,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {513#true} {513#true} #61#return; {513#true} is VALID [2022-04-28 12:47:09,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-28 12:47:09,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#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(10, 2);call #Ultimate.allocInit(12, 3); {513#true} is VALID [2022-04-28 12:47:09,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {513#true} call ULTIMATE.init(); {513#true} is VALID [2022-04-28 12:47:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:47:09,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:09,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607852181] [2022-04-28 12:47:09,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:09,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100565427] [2022-04-28 12:47:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100565427] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:47:09,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:47:09,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-28 12:47:09,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715462224] [2022-04-28 12:47:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715462224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:09,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:09,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:47:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689983412] [2022-04-28 12:47:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 12:47:09,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:09,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:47:09,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:47:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:09,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:47:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:47:09,242 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:47:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:09,849 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 12:47:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:47:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 12:47:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:47:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 12:47:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:47:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 12:47:09,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-28 12:47:09,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:09,888 INFO L225 Difference]: With dead ends: 31 [2022-04-28 12:47:09,888 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 12:47:09,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:47:09,889 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:47:09,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:47:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 12:47:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 12:47:09,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:09,891 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-28 12:47:09,891 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-28 12:47:09,891 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-28 12:47:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:09,891 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:47:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:47:09,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:09,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:09,892 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-28 12:47:09,892 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-28 12:47:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:09,892 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:47:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:47:09,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:09,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:09,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:09,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:09,893 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-28 12:47:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 12:47:09,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-28 12:47:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:09,893 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 12:47:09,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:47:09,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 12:47:09,894 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-28 12:47:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:47:09,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:09,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:47:09,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:47:10,119 WARN L477 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-28 12:47:10,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 12:47:10,240 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 12:47:10,240 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 12:47:10,240 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 12:47:10,240 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 12:47:10,240 INFO L902 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: true [2022-04-28 12:47:10,240 INFO L902 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: true [2022-04-28 12:47:10,240 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: true [2022-04-28 12:47:10,242 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 44) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-28 12:47:10,242 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 44) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-28 12:47:10,242 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 23 47) the Hoare annotation is: true [2022-04-28 12:47:10,242 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-28 12:47:10,242 INFO L902 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: true [2022-04-28 12:47:10,242 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 12:47:10,242 INFO L902 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: true [2022-04-28 12:47:10,242 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 23 47) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 23 47) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-28 12:47:10,243 INFO L895 garLoopResultBuilder]: At program point L36-1(lines 35 44) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 12:47:10,243 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 12:47:10,244 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 12:47:10,244 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 12:47:10,244 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 12:47:10,244 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 12:47:10,244 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 12:47:10,245 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 12:47:10,247 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 12:47:10,249 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:47:10,256 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:47:10,257 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:47:10,281 INFO L163 areAnnotationChecker]: CFG has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 12:47:10,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:47:10 BoogieIcfgContainer [2022-04-28 12:47:10,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:47:10,299 INFO L158 Benchmark]: Toolchain (without parser) took 3772.48ms. Allocated memory was 192.9MB in the beginning and 289.4MB in the end (delta: 96.5MB). Free memory was 138.7MB in the beginning and 158.0MB in the end (delta: -19.3MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. [2022-04-28 12:47:10,300 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:47:10,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.22ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 164.0MB in the end (delta: -25.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-28 12:47:10,302 INFO L158 Benchmark]: Boogie Preprocessor took 26.03ms. Allocated memory is still 192.9MB. Free memory was 164.0MB in the beginning and 162.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 12:47:10,302 INFO L158 Benchmark]: RCFGBuilder took 241.53ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 151.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 12:47:10,304 INFO L158 Benchmark]: TraceAbstraction took 3299.01ms. Allocated memory was 192.9MB in the beginning and 289.4MB in the end (delta: 96.5MB). Free memory was 151.4MB in the beginning and 158.0MB in the end (delta: -6.6MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2022-04-28 12:47:10,306 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.13ms. Allocated memory is still 192.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.22ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 164.0MB in the end (delta: -25.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.03ms. Allocated memory is still 192.9MB. Free memory was 164.0MB in the beginning and 162.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 241.53ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 151.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3299.01ms. Allocated memory was 192.9MB in the beginning and 289.4MB in the end (delta: 96.5MB). Free memory was 151.4MB in the beginning and 158.0MB in the end (delta: -6.6MB). Peak memory consumption was 91.5MB. 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: 17]: 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 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 70 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 67 PreInvPairs, 99 NumberOfFragments, 102 HoareAnnotationTreeSize, 67 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 77 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: x + z * y == z * x + 1 - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 12:47:10,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...