/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/fermat2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:19:36,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:19:36,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:19:36,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:19:36,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:19:36,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:19:36,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:19:36,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:19:36,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:19:37,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:19:37,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:19:37,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:19:37,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:19:37,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:19:37,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:19:37,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:19:37,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:19:37,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:19:37,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:19:37,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:19:37,015 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:19:37,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:19:37,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:19:37,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:19:37,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:19:37,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:19:37,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:19:37,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:19:37,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:19:37,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:19:37,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:19:37,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:19:37,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:19:37,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:19:37,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:19:37,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:19:37,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:19:37,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:19:37,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:19:37,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:19:37,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:19:37,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:19:37,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:19:37,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:19:37,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:19:37,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:19:37,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:19:37,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:19:37,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:19:37,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:19:37,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:19:37,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:19:37,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:19:37,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:19:37,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:19:37,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:19:37,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:19:37,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:19:37,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:19:37,048 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:19:37,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:19:37,049 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:19:37,049 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 04:19:37,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:19:37,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:19:37,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:19:37,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:19:37,261 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:19:37,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/fermat2-ll.c [2022-04-28 04:19:37,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7b0613b/2b5d2ad2983448239a37e5fbb001e019/FLAGa05ac0f6e [2022-04-28 04:19:37,685 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:19:37,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat2-ll.c [2022-04-28 04:19:37,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7b0613b/2b5d2ad2983448239a37e5fbb001e019/FLAGa05ac0f6e [2022-04-28 04:19:37,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7b0613b/2b5d2ad2983448239a37e5fbb001e019 [2022-04-28 04:19:37,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:19:37,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:19:37,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:19:37,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:19:37,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:19:37,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743d270a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37, skipping insertion in model container [2022-04-28 04:19:37,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:19:37,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:19:37,833 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/fermat2-ll.c[524,537] [2022-04-28 04:19:37,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:19:37,848 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:19:37,855 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/fermat2-ll.c[524,537] [2022-04-28 04:19:37,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:19:37,869 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:19:37,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37 WrapperNode [2022-04-28 04:19:37,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:19:37,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:19:37,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:19:37,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:19:37,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:19:37,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:19:37,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:19:37,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:19:37,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (1/1) ... [2022-04-28 04:19:37,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:19:37,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:19:37,912 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 04:19:37,918 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 04:19:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:19:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:19:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:19:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:19:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:19:37,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:19:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:19:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:19:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:19:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:19:37,979 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:19:37,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:19:38,123 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:19:38,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:19:38,128 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:19:38,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:19:38 BoogieIcfgContainer [2022-04-28 04:19:38,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:19:38,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:19:38,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:19:38,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:19:38,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:19:37" (1/3) ... [2022-04-28 04:19:38,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a25fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:19:38, skipping insertion in model container [2022-04-28 04:19:38,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:19:37" (2/3) ... [2022-04-28 04:19:38,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a25fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:19:38, skipping insertion in model container [2022-04-28 04:19:38,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:19:38" (3/3) ... [2022-04-28 04:19:38,134 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll.c [2022-04-28 04:19:38,156 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:19:38,157 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:19:38,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:19:38,216 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@d9bad5c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bdef2a8 [2022-04-28 04:19:38,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:19:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 04:19:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:19:38,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:38,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:38,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 1 times [2022-04-28 04:19:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:38,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281582369] [2022-04-28 04:19:38,267 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:19:38,271 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 2 times [2022-04-28 04:19:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885591095] [2022-04-28 04:19:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:38,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:19:38,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542541017] [2022-04-28 04:19:38,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:19:38,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:19:38,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:19:38,349 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 04:19:38,349 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 04:19:38,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:19:38,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:19:38,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 04:19:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:38,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:19:38,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2022-04-28 04:19:38,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 04:19:38,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 04:19:38,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-28 04:19:38,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 04:19:38,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-28 04:19:38,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32#true} is VALID [2022-04-28 04:19:38,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 04:19:38,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {32#true} is VALID [2022-04-28 04:19:38,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 04:19:38,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#true} {32#true} #58#return; {32#true} is VALID [2022-04-28 04:19:38,535 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {32#true} is VALID [2022-04-28 04:19:38,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 04:19:38,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 04:19:38,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 04:19:38,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {32#true} #60#return; {33#false} is VALID [2022-04-28 04:19:38,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {33#false} is VALID [2022-04-28 04:19:38,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 04:19:38,539 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33#false} is VALID [2022-04-28 04:19:38,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 04:19:38,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 04:19:38,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 04:19:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:19:38,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:19:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:38,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885591095] [2022-04-28 04:19:38,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:19:38,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542541017] [2022-04-28 04:19:38,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542541017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:38,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:38,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 04:19:38,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:38,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281582369] [2022-04-28 04:19:38,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281582369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:38,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:38,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 04:19:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625152857] [2022-04-28 04:19:38,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 04:19:38,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:38,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:19:38,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:38,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 04:19:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:38,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 04:19:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 04:19:38,612 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:19:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:38,682 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 04:19:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 04:19:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 04:19:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:19:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-04-28 04:19:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:19:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-04-28 04:19:38,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-04-28 04:19:38,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:38,771 INFO L225 Difference]: With dead ends: 51 [2022-04-28 04:19:38,771 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 04:19:38,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 04:19:38,780 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:38,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:19:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 04:19:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 04:19:38,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:38,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 04:19:38,808 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 04:19:38,809 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 04:19:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:38,815 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 04:19:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 04:19:38,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:38,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:38,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 04:19:38,820 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 04:19:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:38,822 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 04:19:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 04:19:38,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:38,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:38,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:38,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 04:19:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 04:19:38,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 04:19:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:38,829 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 04:19:38,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:19:38,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 04:19:38,855 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 04:19:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 04:19:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:19:38,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:38,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:38,875 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 04:19:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 04:19:39,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 1 times [2022-04-28 04:19:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805306642] [2022-04-28 04:19:39,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:19:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 2 times [2022-04-28 04:19:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:39,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702361708] [2022-04-28 04:19:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:39,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:19:39,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997602806] [2022-04-28 04:19:39,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:19:39,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:19:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:19:39,097 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 04:19:39,098 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 04:19:39,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:19:39,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:19:39,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:19:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:19:40,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2022-04-28 04:19:40,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#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(13, 2);call #Ultimate.allocInit(12, 3); {297#true} is VALID [2022-04-28 04:19:40,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2022-04-28 04:19:40,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #66#return; {297#true} is VALID [2022-04-28 04:19:40,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret6 := main(); {297#true} is VALID [2022-04-28 04:19:40,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {297#true} is VALID [2022-04-28 04:19:40,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {297#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {297#true} is VALID [2022-04-28 04:19:40,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#true} ~cond := #in~cond; {297#true} is VALID [2022-04-28 04:19:40,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#true} assume !(0 == ~cond); {297#true} is VALID [2022-04-28 04:19:40,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {297#true} assume true; {297#true} is VALID [2022-04-28 04:19:40,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {297#true} {297#true} #58#return; {297#true} is VALID [2022-04-28 04:19:40,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {297#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {297#true} is VALID [2022-04-28 04:19:40,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#true} ~cond := #in~cond; {297#true} is VALID [2022-04-28 04:19:40,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#true} assume !(0 == ~cond); {297#true} is VALID [2022-04-28 04:19:40,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {297#true} assume true; {297#true} is VALID [2022-04-28 04:19:40,187 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {297#true} {297#true} #60#return; {297#true} is VALID [2022-04-28 04:19:40,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {297#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {350#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 04:19:40,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !false; {350#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 04:19:42,760 WARN L272 TraceCheckUtils]: 18: Hoare triple {350#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {357#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 04:19:42,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {357#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:19:42,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {298#false} is VALID [2022-04-28 04:19:42,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {298#false} assume !false; {298#false} is VALID [2022-04-28 04:19:42,762 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 04:19:42,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:19:42,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702361708] [2022-04-28 04:19:42,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:19:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997602806] [2022-04-28 04:19:42,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997602806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:42,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:42,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:19:42,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805306642] [2022-04-28 04:19:42,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805306642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:42,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:42,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:19:42,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514388189] [2022-04-28 04:19:42,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-28 04:19:42,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:42,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:19:43,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:19:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:19:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:19:43,574 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:19:46,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:19:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:47,015 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 04:19:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:19:47,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-28 04:19:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:19:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 04:19:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:19:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 04:19:47,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 04:19:47,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:47,806 INFO L225 Difference]: With dead ends: 35 [2022-04-28 04:19:47,806 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:19:47,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 04:19:47,807 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:47,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 04:19:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:19:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-28 04:19:47,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:47,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) 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), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:19:47,817 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) 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), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:19:47,818 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) 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), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:19:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:47,819 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 04:19:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 04:19:47,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:47,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:47,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) 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), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-28 04:19:47,820 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) 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), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-28 04:19:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:47,822 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 04:19:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 04:19:47,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:47,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:47,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:47,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) 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), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:19:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-28 04:19:47,824 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-04-28 04:19:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:47,824 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-28 04:19:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 04:19:47,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-28 04:19:50,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 04:19:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:19:50,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:50,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:50,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 04:19:50,778 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,SelfDestructingSolverStorable1 [2022-04-28 04:19:50,778 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 1 times [2022-04-28 04:19:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:50,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1947680582] [2022-04-28 04:19:50,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:19:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 2 times [2022-04-28 04:19:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:50,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843420952] [2022-04-28 04:19:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:50,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:19:50,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380200403] [2022-04-28 04:19:50,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:19:50,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:19:50,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:19:50,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:19:50,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:19:50,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:19:50,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:19:50,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 04:19:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:50,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:19:51,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-28 04:19:51,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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(13, 2);call #Ultimate.allocInit(12, 3); {565#true} is VALID [2022-04-28 04:19:51,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:19:51,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #66#return; {565#true} is VALID [2022-04-28 04:19:51,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret6 := main(); {565#true} is VALID [2022-04-28 04:19:51,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {565#true} is VALID [2022-04-28 04:19:51,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {565#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {565#true} is VALID [2022-04-28 04:19:51,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 04:19:51,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 04:19:51,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:19:51,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {565#true} {565#true} #58#return; {565#true} is VALID [2022-04-28 04:19:51,017 INFO L272 TraceCheckUtils]: 11: Hoare triple {565#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {565#true} is VALID [2022-04-28 04:19:51,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 04:19:51,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 04:19:51,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:19:51,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {565#true} {565#true} #60#return; {565#true} is VALID [2022-04-28 04:19:51,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {565#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {565#true} is VALID [2022-04-28 04:19:51,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#true} assume !false; {565#true} is VALID [2022-04-28 04:19:51,018 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {565#true} is VALID [2022-04-28 04:19:51,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#true} ~cond := #in~cond; {627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:19:51,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:19:51,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:19:51,020 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {631#(not (= |__VERIFIER_assert_#in~cond| 0))} {565#true} #62#return; {638#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-28 04:19:51,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {638#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {642#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 04:19:51,021 INFO L272 TraceCheckUtils]: 24: Hoare triple {642#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:19:51,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:19:51,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-28 04:19:51,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-28 04:19:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:19:51,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:19:51,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-28 04:19:51,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-28 04:19:51,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:19:51,384 INFO L272 TraceCheckUtils]: 24: Hoare triple {642#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:19:51,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {669#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {642#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 04:19:51,386 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {631#(not (= |__VERIFIER_assert_#in~cond| 0))} {565#true} #62#return; {669#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-28 04:19:51,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:19:51,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:19:51,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#true} ~cond := #in~cond; {682#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:19:51,387 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {565#true} is VALID [2022-04-28 04:19:51,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#true} assume !false; {565#true} is VALID [2022-04-28 04:19:51,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {565#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {565#true} is VALID [2022-04-28 04:19:51,387 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {565#true} {565#true} #60#return; {565#true} is VALID [2022-04-28 04:19:51,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:19:51,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 04:19:51,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 04:19:51,388 INFO L272 TraceCheckUtils]: 11: Hoare triple {565#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {565#true} is VALID [2022-04-28 04:19:51,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {565#true} {565#true} #58#return; {565#true} is VALID [2022-04-28 04:19:51,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:19:51,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 04:19:51,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 04:19:51,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {565#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {565#true} is VALID [2022-04-28 04:19:51,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {565#true} is VALID [2022-04-28 04:19:51,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret6 := main(); {565#true} is VALID [2022-04-28 04:19:51,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #66#return; {565#true} is VALID [2022-04-28 04:19:51,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 04:19:51,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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(13, 2);call #Ultimate.allocInit(12, 3); {565#true} is VALID [2022-04-28 04:19:51,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-28 04:19:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:19:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:51,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843420952] [2022-04-28 04:19:51,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:19:51,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380200403] [2022-04-28 04:19:51,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380200403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:19:51,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:19:51,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 04:19:51,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1947680582] [2022-04-28 04:19:51,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1947680582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:51,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:51,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:19:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030832978] [2022-04-28 04:19:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 04:19:51,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:51,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:19:51,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:51,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:19:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:19:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:19:51,425 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:19:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:51,717 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 04:19:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:19:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 04:19:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:19:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 04:19:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:19:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 04:19:51,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-28 04:19:51,744 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 04:19:51,744 INFO L225 Difference]: With dead ends: 30 [2022-04-28 04:19:51,744 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:19:51,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:19:51,745 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:51,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:19:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:19:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:19:51,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:51,746 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 04:19:51,746 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 04:19:51,746 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 04:19:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:51,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:19:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:19:51,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:51,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:51,747 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 04:19:51,747 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 04:19:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:51,747 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:19:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:19:51,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:51,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:51,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:51,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:51,747 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 04:19:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:19:51,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 04:19:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:51,747 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:19:51,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:19:51,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:19:51,748 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 04:19:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:19:51,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:51,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:19:51,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:19:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:19:51,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:19:52,035 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 04:19:52,035 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 04:19:52,035 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 04:19:52,035 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 44) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 49) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 49) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-28 04:19:52,036 INFO L895 garLoopResultBuilder]: At program point L34-1(lines 33 44) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 49) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: true [2022-04-28 04:19:52,036 INFO L895 garLoopResultBuilder]: At program point L37(lines 37 43) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-28 04:19:52,036 INFO L895 garLoopResultBuilder]: At program point L37-2(lines 33 44) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-28 04:19:52,036 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 04:19:52,037 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:19:52,037 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:19:52,037 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:19:52,037 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:19:52,037 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:19:52,039 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 04:19:52,040 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:19:52,042 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:19:52,043 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:19:52,053 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:19:52,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:19:52 BoogieIcfgContainer [2022-04-28 04:19:52,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:19:52,060 INFO L158 Benchmark]: Toolchain (without parser) took 14360.30ms. Allocated memory was 200.3MB in the beginning and 262.1MB in the end (delta: 61.9MB). Free memory was 152.5MB in the beginning and 91.2MB in the end (delta: 61.3MB). Peak memory consumption was 123.5MB. Max. memory is 8.0GB. [2022-04-28 04:19:52,060 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:19:52,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.15ms. Allocated memory is still 200.3MB. Free memory was 152.3MB in the beginning and 176.1MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 04:19:52,061 INFO L158 Benchmark]: Boogie Preprocessor took 18.25ms. Allocated memory is still 200.3MB. Free memory was 176.1MB in the beginning and 174.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:19:52,061 INFO L158 Benchmark]: RCFGBuilder took 240.37ms. Allocated memory is still 200.3MB. Free memory was 174.5MB in the beginning and 163.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:19:52,061 INFO L158 Benchmark]: TraceAbstraction took 13929.44ms. Allocated memory was 200.3MB in the beginning and 262.1MB in the end (delta: 61.9MB). Free memory was 162.9MB in the beginning and 91.2MB in the end (delta: 71.8MB). Peak memory consumption was 134.6MB. Max. memory is 8.0GB. [2022-04-28 04:19:52,062 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.12ms. Allocated memory is still 200.3MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.15ms. Allocated memory is still 200.3MB. Free memory was 152.3MB in the beginning and 176.1MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.25ms. Allocated memory is still 200.3MB. Free memory was 176.1MB in the beginning and 174.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 240.37ms. Allocated memory is still 200.3MB. Free memory was 174.5MB in the beginning and 163.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13929.44ms. Allocated memory was 200.3MB in the beginning and 262.1MB in the end (delta: 61.9MB). Free memory was 162.9MB in the beginning and 91.2MB in the end (delta: 71.8MB). Peak memory consumption was 134.6MB. 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: 14]: 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: 13.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 71 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 61 PreInvPairs, 87 NumberOfFragments, 175 HoareAnnotationTreeSize, 61 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 04:19:52,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...